The below is information I posted in another thread that explains the background information of what I am studying and what I understand (I am still having trouble with understanding big-Oh concepts):
What I am trouble with is understanding how to prove that one function is NOT big-Oh of the other. Proving that a function IS big-Oh of another function is relatively easier since you only need to find one positive constant C and k that allows one function to be big-Oh of another. But proving it isn't is harder because you have to establish that there exists no constants C and k that allow one function to be big-Oh of the other.
What I am confused about is that I I don't understand how to get from step 2 to 3. Why is the 10x allowed to be removed? I have been researching this and wracking my brain but I don't get how you are allowed to get rid of it.
For context, I am majoring in Computer Science and am taking a Data Structures class. We are studying big-Oh notation which allows you to compare how one function grows compared to another. To find whether a function is big-Oh of another we would say that:
(This definition found at https://www.cs.sfu.ca/~ggbaker/zju/math/growth.html)For functions f(x) and g(x), we will say that "f(x) is O(g(x))” [pronounced "(x) is big-oh of g(x)"] if there are positive constants C and k such that
|f(x)|≤C|g(x)| for all x>k.
I understand that for f(x) to be big-Oh of g(x) there must exist at least one corresponding C and k such that g(x) will grow either equally or faster than f(x) forever more when x becomes greater than k.
What I am trouble with is understanding how to prove that one function is NOT big-Oh of the other. Proving that a function IS big-Oh of another function is relatively easier since you only need to find one positive constant C and k that allows one function to be big-Oh of another. But proving it isn't is harder because you have to establish that there exists no constants C and k that allow one function to be big-Oh of the other.
Here is how to figure out if a function is NOT big-Oh of another function according to the link provided above:
Example: The function f(x)=2x3+10x is not in O(x2).
Proof: Now we must show that no C and k exist to meet the condition from the definition.
For any candidate C and k, we can take x>k and x>0 and we would have to satisfy
//This is my note. The person who is posting on Free Math Help. These steps are labeled 1 to 4 for convenience in discussing them
|2x3+10x| < C|x2| //1
2x3+10x < Cx2 //2
2x3 < Cx2 //3
x < C/2 //4
So no such C and k can exist to let the inequality hold for large x.∎
What I am confused about is that I I don't understand how to get from step 2 to 3. Why is the 10x allowed to be removed? I have been researching this and wracking my brain but I don't get how you are allowed to get rid of it.