27 May 12, 12:38AM
#10 (medium):
Prove that for n>4, F_n is composite if n is composite. F_n is the nth Fibonacci number (F_0 = 0, F_1 = 1, F_2 = 1, F_3 = 2, F_4 = 3, ..).
Prove that for n>4, F_n is composite if n is composite. F_n is the nth Fibonacci number (F_0 = 0, F_1 = 1, F_2 = 1, F_3 = 2, F_4 = 3, ..).