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.

Almost every Fibonacci prime is in a prime position in the Fibonacci sequence. However, the 4th Fibonacci number is 3. That is weird.

Posted by Math Man on 2011-01-01 16:32:35