## Fibonacci numbers and Fermat's last theorem

### Volume 60 / 1992

#### Abstract

Let {Fₙ} be the Fibonacci sequence defined by F₀=0, F₁=1, $F_{n+1}=Fₙ+F_{n-1} (n≥1)$. It is well known that $F_{p-(5/p)}≡ 0 (mod p)$ for any odd prime p, where (-) denotes the Legendre symbol. In 1960 D. D. Wall [13] asked whether $p²|F_{p-(5/p)}$ is always impossible; up to now this is still open. In this paper the sum $∑_{k≡ r (mod 10)}{n\choose k}$ is expressed in terms of Fibonacci numbers. As applications we obtain a new formula for the Fibonacci quotient $F_{p-(5/p)}/p$ and a criterion for the relation $p|F_{(p-1)/4}$ (if p ≡ 1 (mod 4), where p ≠ 5 is an odd prime. We also prove that the affirmative answer to Wall's question implies the first case of FLT (Fermat's last theorem); from this it follows that the first case of FLT holds for those exponents which are (odd) Fibonacci primes or Lucas primes.