Results 1 to 1 of 1

Math Help - Euclidean Alogritm and Fibonacci proof problem

  1. #1
    Junior Member
    Joined
    Oct 2011
    Posts
    37

    Euclidean Algorithm and Fibonacci proof problem

    Stuck on this CW question. have been learing about Eulcidean Algorithm and Bezouts Identity but I'm at a complete loss.
    Q: Prove by induction that if r _{n+1} is the first remainder equal to 0 in the Euclidean Algorithm then r _{n+1-k} \geq f _{k}
    I know that proof by induction starts with a base step with n = 1; leading to the inductive step on n+1 but I'm struggling to even understand the question properly.
    Any advice at all would be appreciated - I'm struggling to understand even the question. The work is due in the morning and I can't find any examples like this on the web.
    Please help
    Felix
    Last edited by FelixHelix; February 29th 2012 at 12:48 PM. Reason: Typos
    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, 02:47 AM
  2. Euclidean Proof
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: February 2nd 2009, 09:43 PM
  3. Fibonacci Proof
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: December 2nd 2008, 05:12 PM
  4. Fibonacci/Euclidean Algorithmn proof
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: November 7th 2007, 04:17 PM
  5. non-Euclidean -help on proof
    Posted in the Discrete Math Forum
    Replies: 6
    Last Post: July 15th 2006, 06:24 PM

Search Tags


/mathhelpforum @mathhelpforum