need to prove P(n): 2^n > n^3, for n>=10
check P(10): 2^10 > 10^3 or 1024 > 1000 is true
now assume P(k) is true, where k >= 10. we now need to prove that if this assumption is made, then P(k+1) is also true.
P(k): 2^k > k^3
P(k+1): 2^(k+1) > (k+1)^3 = k^3 + 3k^2 + 3k + 1
LHS = 2^(k+1)
=2*2^k
>2*k^3 (from inductive hypothesis)
= k^3 + k^3
>k^3 + 3k^2 + 3k + 1 (prove later that k^3 > 3k^2 + 3k + 1 for k>= 10)
=(k+1)^3
if all's well, then P(k+1) is also true, which means, according to the principle of maths induction, P(n) is true.
now we need to prove that k^3 > 3k^2 + 3k + 1, for k>= 10
now since k>= 10
k^3 = k*k^2 >= 10k^2 = 3k^2 + 3k^2 + 4k^2 which is obviously greater than 3k^2 + 3k + 1
QED