# Carmichael's Theorem

Jump to navigation
Jump to search

## Contents

## Theorem

Let $n \in \Z$ such that $n > 12$.

Then the $n$th Fibonacci number $\map F n$ has at least one prime factor which does not divide any smaller Fibonacci number.

The exceptions for $n \le 12$ are:

- $\map F 1 = 1, \map F 2 = 1$: neither have any prime factors
- $\map F 6 = 8$ whose only prime factor is $2$ which is $\map F 3$
- $\map F {12} = 144$ whose only prime factors are $2$ (which is $\map F 3$) and $3$ (which is $\map F 4$).

## Proof

## Also see

## Source of Name

This entry was named for Robert Daniel Carmichael.

## Sources

- 1913: R.D. Carmichael:
*On the numerical factors of the arithmetic forms $\alpha^n + \beta^n$*(*Ann. Math.***Vol. 15**,*no. 1/4*: pp. 30 – 70) www.jstor.org/stable/1967797