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

Home > Numbers
GCD of Fibonacci 2 (Posted on 2016-03-23) Difficulty: 2 of 5
This is an extension of GCD of Fibonacci.

Denote the nth term of the Fibonacci sequence as F(n), with F(0)=0 and F(1)=1. Let S_n be the set {F(n), F(n+1), F(n+2), F(n+3)}.

For what values n does there exist a pair of numbers from S_n with a GCD greater than 1?

See The Solution Submitted by Brian Smith    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some Thoughtsre: possible solutionbroll2016-03-24 00:09:54
possible solutionarmando2016-03-23 09:53:30
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (6)
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

Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information