For what value of n this inequality is true and how to find it step by step?

24 Views Asked by At

The inequality is $1000n^3<2^n$ I'm trying to see for what value of $n$ an algorithm A who takes ($1000n^3$) steps takes less time than another algorithm B who takes($2^n$) steps.

Any idea how to do that step by step?