Subscribe to the weekly news from TrueShelf

0

Fibonacci numbers and primes

The Fibonacci numbers are defined by \(F_1 = F_2 = 1\) and \(F_n = F_{n−1} + F_{n−2}\) for \(n \geq 3\). If \(p\) is a prime number, prove that at least one of the first \(p + 1\) Fibonacci numbers must be divisible by \(p\).

Related Content