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

Home > Numbers
Five by Five (Posted on 2013-10-21) Difficulty: 2 of 5
The Fibonacci recurrence (F1 = 1, F2 = 1 and Fn = Fn - 1 + Fn - 2) leads to an infinite sequence of numbers starting with

1, 1, 2, 3, 5,
8, 13, 21, 34, 55,
89, 144, 233, 377, 610, ...

Note that the 5th, 10th and 15th numbers are all divisible by 5.
Show that every fifth number in the sequence is divisible by 5.

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution modular solution | Comment 1 of 2

When the Fibonacci process is done mod 5, the groups of 5 repeat starting at F(21):

 1, 1, 2, 3, 0, 3, 3, 1, 4, 0, 4, 4, 3, 2, 0, 2, 2, 4, 1, 0,
 1, 1, 2, 3, 0,

and from then on have to repeat.


  Posted by Charlie on 2013-10-21 13:05:30
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 (6)
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