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.)
re: modular solution Comment 2 of 2 |
(In reply to modular solution by Charlie)

The process must repeat in any modulus.  I investigated the way it repeats in different moduli.  The results led me to some interesting sequences in the OEIS, but I couldn't think of a good Perplexus problem arising from it.
  Posted by Jer on 2013-10-22 13:54: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 (14)
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