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: ( You must be logged in to post comments.)
  Subject Author Date
Fibonacci primesMath Man2011-01-01 16:32:35
re(2): Fibs and primes PRIVATE REMARKSbroll2010-07-22 13:09:15
re: Fibs and primes PRIVATE REMARKSAdy TZIDON2010-07-22 12:48:15
Some ThoughtsFibs and primesbroll2010-07-22 10:12:40
re: ObservationAdy TZIDON2010-07-21 14:39:36
Observationed bottemiller2010-07-21 14:00:52
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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information