Results 1 to 2 of 2

Math Help - Another Fibonacci Proof

  1. #1
    Junior Member
    Joined
    May 2006
    Posts
    52

    Another Fibonacci Proof

    I searched the forum and couldn't find this proof. I keep getting stuck once I start to substitute. I don't think its that hard, I just can't get past the substitution!!!! Help!!! TIA

    Refer to the defnition of Fibonacci numbers F(n)
    F(1) = 1
    F(2) = 1
    F(n) = F(n-1) + F(n-2)

    Use strong induction to show that F(n+k) = F(n+1)F(k) + F(n)F(k−1)
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Junior Member
    Joined
    May 2006
    Posts
    52
    I have attempted to solve this problem all weekend and have gotten no where. Can someone please help me!?!?!? Or at least point me in the right direction? TIA
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Fibonacci Proof
    Posted in the Number Theory Forum
    Replies: 6
    Last Post: November 28th 2009, 10:21 PM
  2. Need help on Fibonacci proof
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: April 23rd 2009, 08:31 AM
  3. Fibonacci Proof
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: December 2nd 2008, 05:12 PM
  4. Fibonacci proof
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: December 26th 2007, 07:37 AM
  5. another fibonacci proof
    Posted in the Algebra Forum
    Replies: 1
    Last Post: October 16th 2007, 07:10 AM

Search Tags


/mathhelpforum @mathhelpforum