Step one: for case where $n=6$
$$7n <2^n$$ $$7(6)<2^6 \rightarrow 42<64$$.
Step two: Suppose for $n$ such that $7n<2^n$ is true. Now prove for $n+1$
$$(2)7n<(2)2^n$$ $$14n<2^{n+1}$$
But since $n<7n<2^n$, then $n+7<7(n+1)<2^n+7<2^{n+1}(?)$.
Then $7(n+1)<2^{n+1}$
I'm new in this induction process, so any help/tips for this problem would be really appreciated.
We will prove the assertion by induction on $n$.
The assertion is true for $n=6$. $\checkmark$
Suppose that the assertion is true for $k=n$; $\color{Blue}{7n<2^n}$.
on the otherhand we know that $\color{Red}{7}<42\leq7n<\color{Red}{2^n}$; so we have :
$$ \color{Green}{7(n+1)}= \color{Blue}{7n} + \color{Red}{7} < \color{Blue}{2^n} + \color{Red}{2^n} = \color{Green}{2^{n+1}} ,$$ so the assertion is true for $\color{Green}{k=n+1}$.