Results 1 to 3 of 3

Math Help - Fibonacci Proof

  1. #1
    Member
    Joined
    Mar 2009
    Posts
    182
    Thanks
    1

    Fibonacci Proof

    Hi all

    Prove that every 4th Fibonacci number is divisible by 3, that is 3|f4n, for all n>=1.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Banned
    Joined
    Oct 2009
    Posts
    4,261
    Thanks
    2
    Quote Originally Posted by sirellwood View Post
    Hi all

    Prove that every 4th Fibonacci number is divisible by 3, that is 3|f4n, for all n>=1.

    Induction and some patience: F_{4n}=F_{4n-1}+F_{4n-2}=F_{4n-2}+F_{4n-3}+F_{4n-3}+F_{4n-4}  = F_{4n-3}+F_{4n-4}+F_{4n-3}+F_{4n-3}+F_{4n-4}=...

    Tonio

    Pd. The solution's already present in the rightmost expression above.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Member
    Joined
    Mar 2009
    Posts
    182
    Thanks
    1
    Sorry, im not sure where you are going with this one?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Fibonacci Proof
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: February 5th 2011, 03:47 AM
  2. Fibonacci Proof
    Posted in the Number Theory Forum
    Replies: 6
    Last Post: November 28th 2009, 11:21 PM
  3. Need help on Fibonacci proof
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: April 23rd 2009, 09:31 AM
  4. Fibonacci Proof
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: December 2nd 2008, 06:12 PM
  5. Another Fibonacci Proof
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: February 11th 2008, 05:17 AM

Search Tags


/mathhelpforum @mathhelpforum