Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I picked this problem from here . I don't know how to solve it accurately. The number seems too to be done by any computation method.

share|cite|improve this question
up vote 3 down vote accepted

Try and compute $\gcd(F_i,F_j)$ for some small $i$ and $j$ and see if you can spot a pattern.

Using the following three facts you can prove by induction that the pattern holds in general:

  • $\gcd(F_n,F_{n-1}) = 1$.
  • $F_{m+n} = F_{m+1}F_n + F_mF_{n-1}$.
  • $m$ divides $n \implies F_m$ divides $F_n$.
share|cite|improve this answer

GCD(Fib(531185354674),Fib(613570636967)) = Fib(GCD(531185354674,613570636967))

share|cite|improve this answer
Yes, and $\text{GCD}(531185354674, 613570636967)=67$ and $\text{Fib}_{67}=44945570212853$ – Listing Jan 24 '11 at 13:20

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.