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

Home > Numbers
Fibonacci Lore (Posted on 2005-06-10) Difficulty: 4 of 5
The Fibonacci sequence goes F(0)=0, F(1)=1, and for n>1, F(n)=F(n-1)+F(n-2).

Show that for every positive integer m there exists an integer n>0 such that m divides F(n).

See The Solution Submitted by McWorter    
Rating: 4.0000 (3 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re(4): Proof--Quick fixNick Hobson2005-06-13 13:26:20
re(3): Proof--Quick fixarmando2005-06-13 12:53:45
re(4): Proof--Quick fixMcWorter2005-06-13 02:16:54
re(4): Proof--Quick fixSteve Herman2005-06-12 23:38:56
SolutionModulo solutionNick Hobson2005-06-12 22:39:38
re(3): Proof--Quick fixTristan2005-06-12 19:30:46
Some Thoughtsre(2): Proof--Quick fixNick Hobson2005-06-11 21:47:44
re(2): Proof--Quick fix -- little quibbleMcWorter2005-06-11 21:46:32
re: Proof--Quick fixTristan2005-06-11 21:33:01
SolutionProofTristan2005-06-11 21:14:07
re(2): CluelessSteve Herman2005-06-11 19:01:30
re: CluelessMcWorter2005-06-11 15:48:04
Here's a good cluePenny2005-06-11 14:18:08
CluelessSteve Herman2005-06-11 12:21:05
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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