Home > Numbers > Sequences
| Fibo composes (Posted on 2010-07-21) |
 |
Fibonacci sequence is defined by f(1)=1,f(2)=1 and f(m) =f(m-1)+f(m-2)
i.e. 1, 1, 2, 3, 5, 8, 13, ...
Prove that for all composite values of n>4, f(n) is composite.
|
No Solution Yet
|
Submitted by Ady TZIDON
|
|
Rating: 3.6667 (3 votes)
|
|
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|
