fibonacci sequence {fn}= 1,1,2,3,5,8,13,... you know this. defined recursively by f1=1 f2=1 fn+2 = fn+1 + fn for n=1,2,3,... use complete induction to prove that fn < 2^n for all positive integers n. I'm just a little confused with the complete induction part the book and teacher didn't explain it too well.