Fibonacci sequence

posted by Mathslover

The Fibonacci sequence
a1=1,a2=1,a3=2,a4=3,a5=5,a6=8…
is defined recursively using the formulas a1=a2=1 and an+2=an+an+1 for all n≥1. Find the greatest common divisor of a484 and a2013.

  1. Steve

    It has been proven that

    gcd(Fm,Fn) = Fgcd(m,n)

    So,

    gcd(F484,F2013) = Fgcd(484,2013) = F11 = 89

Respond to this Question

First Name

Your Answer

Similar Questions

  1. maths! please help me it is an emergency!!!!!!!!!!

    what is the fibonacci sequence and what is its relationship to the golden ratio?
  2. math

    There is no function equation for the Fibonacci numbers, you have to use a Recursion formula. F(n) = F(n-1) + F(n-2) for n>2 and F(1)=1, F(2)=1 what is the equation for the fibonacci sequence
  3. Math

    F25= 75,025 and F26= 121,393 where Fn is the nth term in the Fibonacci sequence. Find F27. I do not understand the Fibonacci sequence, could someone help me with my question and explain it to me please.
  4. Computer Science - MATLAB

    One interesting property of a Fibonacci sequence is that the ratio of the values of adjacent members of the sequence approach a number called “the golden ratio” or PHI. Create a program that accepts the first two numbers of a Fibonacci …
  5. Computer Science - MATLAB

    I guess it was skipped One interesting property of a Fibonacci sequence is that the ratio of the values of adjacent members of the sequence approach a number called “the golden ratio” or PHI. Create a program that accepts the first …
  6. Pre-Calc

    Find three examples of the Fibonacci sequence in nature. Write a paragraph for each example. For each example, address the following questions: How does the example relate to the Fibonacci sequence?
  7. Math (fibonacci

    A sequence of numbers is called a Fibonacci-type sequence if each number (after for the first two) is the sum of the two numbers which precede it. For example, 1, 1, 2, 3, 5, 8 ... is a Fibonacci- type sequence. If 1985, x, y, 200 …
  8. Fibonacci Sequence

    The sequence < un > is defined by the recurrence Un+1 = 3Un+1\5Un+3 initial condition of u1 = 1: Need to show un in terms of Fibonacci / Lucas numbers
  9. Maths

    The Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, ... starts with two 1s, and each term afterwards is the sum of its two predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci …
  10. Sequences

    Like the Fibonacci sequence, a certain sequence satisfies the recurrence relation an=an−1+an−2. Unlike the Fibonacci sequence, however, the first two terms are a1=4 and a2=1. Find a32.

More Similar Questions