Fibonacci Sequence - Induction.

  • Context: Graduate 
  • Thread starter Thread starter glover_m
  • Start date Start date
  • Tags Tags
    Induction Sequence
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
1 reply · 8K views
glover_m
Messages
9
Reaction score
0
Prove Fn ≤ (7/4)n for all n, 0≤n

Fn = Fn-1 + Fn-2

Let P(n) be true for some n = k, for 0≤k

Let n = k+1

Fk+1 ≤ (7/4)k+1

LHS: Fk+1 = Fk + Fk-1 ≤ Fk-1 + (7/4)k ≤ (7/4)k-1 + (7/4)k

This last line is where I'm stuck, I feel like either I messed up early on, or I'm missing a way of simplifying this to look like (7/4)k+1
 
Physics news on Phys.org
glover_m said:
Prove Fn ≤ (7/4)n for all n, 0≤n

Fn = Fn-1 + Fn-2

Let P(n) be true for some n = k, for 0≤k

Let n = k+1

Fk+1 ≤ (7/4)k+1

LHS: Fk+1 = Fk + Fk-1 ≤ Fk-1 + (7/4)k ≤ (7/4)k-1 + (7/4)k

This last line is where I'm stuck, I feel like either I messed up early on, or I'm missing a way of simplifying this to look like (7/4)k+1
Well, [itex](7/4)^{k-1}= (4/7)(7/4)^k[/itex] so [itex](7/4)^{k-1}+ (7/4)^k= (4/7+ 1)(7/4)^k[/itex]. And 4/7+ 1= 11/7= (11/7)(4/7)(7/4)= (44/49)(7/4) and 44/49< 1.