
#1
Nov810, 11:05 AM

P: 29

1. The problem statement, all variables and given/known data
The Fibonacci numbers are defined recusively by: F(0) = 0, F(1) = 1, for n > 1, F(n) = F(n − 1) + F(n − 2). Use strong induction to show that F(n) < 2^n for all n. 2. Relevant equations n/a 3. The attempt at a solution I use my base case as F(2) = F(1) + F(0) = 1 which is less than 2^n = 2^2 = 4. After that I am not sure where to go with strong induction... 



#2
Nov810, 11:21 AM

Mentor
P: 16,703

The induction hypthesis gives us
[tex]F(n)=F(n1)+F(n2)\leq 2^{n1}+2^{n2}[/tex] Can you now prove that this is smaller then [tex]2^n[/tex]? 



#3
Nov810, 01:04 PM

P: 29

well 2^n1 + 2^n2 is equal to 2^n (2^1 + 2^2) = 3/4(2^n) but I don't see the logic behind equating the problem to less than or equal to 2^n1 + 2^n2




#4
Nov810, 01:12 PM

Mentor
P: 16,703

Fibonacci Number Proof
If you want to apply induction? Then what is the induction hypothesis?




#5
Nov810, 01:15 PM

P: 29

Let k>2, for all integers i, with 2<=i<k, F(i)<2^i would be my induction hypothesis I think?




#6
Nov810, 01:19 PM

Mentor
P: 16,703

Yes, that is correct. So in particular, we have
[tex]F(n1)\leq 2^{n1}~\text{and}~F(n2)\leq 2^{n2}[/tex] So [tex]F(n1)+F(n2)\leq 2^{n1}+2^{n2}[/tex] 



#7
Nov810, 01:20 PM

P: 29

woops, I meant n>2, so just replace all my k's with n's and so if I know that F(i)<2^i, then F(i1) + F(i2) < 2^i1 + 2^i2 which is F(i) < 3/4 2^i, so therefore F(i) must also be less than 2^i if its less than 0.75 of it, so the statement is true for all F(n)




#8
Nov810, 01:21 PM

P: 29

does that look about right?




#10
Nov810, 01:27 PM

P: 29

thank you :), so in general with strong induction, you prove a base, then your induction hypothesis is that it works for all numbers between your base up until some value n, and you have to prove using this, that it also works for the n? thank you for all your help!




#11
Nov810, 01:33 PM

Mentor
P: 16,703

Yep, that is the idea behind strong induction.
Good luck with your next problems! 



#12
Nov810, 01:34 PM

P: 29

thank you:)



Register to reply 
Related Discussions  
Find the previous Fibonacci number: java  Engineering, Comp Sci, & Technology Homework  3  
Fibonacci proof by induction  Calculus & Beyond Homework  13  
Fibonacci Proof with Induction  Calculus & Beyond Homework  1  
Fibonacci Number Crunch  Calculus & Beyond Homework  1  
Explicit Formula for the nth Fibonacci Number  Introductory Physics Homework  12 