Is k^3 O(n^2) for some constant k > 1?

16 Views Asked by At

On the one hand a constant should be upper bounded by a variable which increases. But I'm not really sure if this is the case, as $k^3$ is a higher power than $n^2$. I'm don't know how to approach this problem as I don't really know take the limit of the two functions and that's normally what I would do.

How would one approach this problem?