All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Fibo and GCD (Posted on 2013-05-02) Difficulty: 3 of 5
Prove:
The GCD (greatest common divisor) of any two Fibonacci numbers: is also a Fibonacci number!
Derive:
A formula for GCD(fm, fn).
What is the GCD(f6, f21)?

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution re: a table (spoiler) Comment 2 of 2 |
(In reply to a table by Charlie)

While working on the Prime Fibonacci Numbers, I came across the Wikipedia article on that topic, but which also included GCD(F(m),F(n)) = F(GCD(m,n)), which agrees with a spot check of the posted table. So GCD(F(6),F(21)) = F(3) = 2.

Edited on May 3, 2013, 2:41 pm
  Posted by Charlie on 2013-05-03 14:38:22

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information