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

Home > Numbers > Sequences
Fibo composes (Posted on 2010-07-21) Difficulty: 4 of 5
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: ( Back to comment list | You must be logged in to post comments.)
re: Observation | Comment 2 of 6 |
(In reply to Observation by ed bottemiller)

There are 2 theorems concerning prime/composite relation
between Fibo series members and their indices.

You write: ..."Neither is asserting that if n is prime, then F(n) must be prime " to  which I'd like to add "and vice versa."

I believe one can EITHER  find the proofs on the WEB  OR work it out independently OR both.


  Posted by Ady TZIDON on 2010-07-21 14:39:36
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 (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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