perplexus.info :: Numbers : Fibonacci Lore

Home > Numbers

Fibonacci Lore (Posted on 2005-06-10)

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
How to setup Microsoft Office for free?	brendon jon	2020-01-07 04:11:38
re(4): Proof--Quick fix	Nick Hobson	2005-06-13 13:26:20
re(3): Proof--Quick fix	armando	2005-06-13 12:53:45
re(4): Proof--Quick fix	McWorter	2005-06-13 02:16:54
re(4): Proof--Quick fix	Steve Herman	2005-06-12 23:38:56
Modulo solution	Nick Hobson	2005-06-12 22:39:38
re(3): Proof--Quick fix	Tristan	2005-06-12 19:30:46
re(2): Proof--Quick fix	Nick Hobson	2005-06-11 21:47:44
re(2): Proof--Quick fix -- little quibble	McWorter	2005-06-11 21:46:32
re: Proof--Quick fix	Tristan	2005-06-11 21:33:01
Proof	Tristan	2005-06-11 21:14:07
re(2): Clueless	Steve Herman	2005-06-11 19:01:30
re: Clueless	McWorter	2005-06-11 15:48:04
Here's a good clue	Penny	2005-06-11 14:18:08
Clueless	Steve Herman	2005-06-11 12:21:05

Please log in:

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

Chatterbox:


perplexus dot info