All Questions
1 question
3
votes
1
answer
474
views
Bound on the number of primitive divisors of the $n$th Fibonacci number
It is a result of Carmichael that for any integer $n > 12$, the Fibonacci number $F_n$ has at least one primitive divisor, that is, a prime factor $p$ such that $p$ does not divide any $F_m$ with $...
- 106