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

Home > Numbers > Sequences
Fibo's common divider (Posted on 2020-06-10) Difficulty: 4 of 5
1,1,2,3,5,8,13...

Given basic Fibonacci sequence (as above) with a1=1 and a2=1 evaluate the GCD of a770 and a1000.

No Solution Yet Submitted by Ady TZIDON    
Rating: 3.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
closed form Comment 4 of 4 |
The formula you want is:

GCD( a_m, a_n) = a_GCD(m,n)

so GCD(a_770, a_1000) = a_10 = 55.


  Posted by FrankM on 2020-06-14 09:27:25
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 (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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