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.
(In reply to re: Fibs and primes PRIVATE REMARKS
by Ady TZIDON)
As usual I had a bit of a struggle to format this, hence the edits.
Knowing practically nothing about maths except what I've learnt from perplexus, I'm always grateful for guidance - please do not hesitate to correct.
Posted by broll
on 2010-07-22 13:09:15