Can someone help me prove this statement by induction or some other proof method?

32 Views Asked by At

Show that $3n < 2^n$ for all integers $n \ge 4$.
I have tried for base $n=5$: then obviously $p(5)$ is true as $$ 3\cdot 5 < 2^5 . $$ Now since $p(x)$ is right I have tried to prove $p(x+1)$ by using it: substituting in the general relation I hope to get $$ 3(n+1) < 2^{n+1} $$ but at this point I don't know how to continue.