Strong Induction for Fibonacci I'm a little lost of how to use strong induction to prove the following for the Fibonacci sequence: 
$F_n < 2^n$ for all natural numbers 
Any help would be very much appreciated!!

Hint: $F_0=0<2^0$, $F_1=1<2^1$. If the statement holds for every $m<n$, where $n\ge2$, then
$$
F_n=F_{n-1}+F_{n-2}
$$
and $n-1<n$, $n-2<n$, so…
