perplexus.info :: Sequences : Fibo's common divider

Home > Numbers > Sequences

Fibo's common divider (Posted on 2020-06-10)

1,1,2,3,5,8,13...

Given basic Fibonacci sequence (as above) with a₁=1 and a₂=1 evaluate the GCD of a₇₇₀ and a₁₀₀₀.

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.)

re: computer solution

| Comment 3 of 4 |

(In reply to computer solution by Charlie)

BTW, the language is UBASIC, used for high precision calculation. The value of the Fibonacci numbers is based on Fibonacci number n is the the nearest integer to the quotient of the golden ratio divided by sqrt(5).

Posted by Charlie on 2020-06-11 05:49:13

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 (21)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info