Fibonaccis and prime numbers

174 Views Asked by At

Let $F_n$ denote the $n$th Fibonacci number, and $p_n$ the $n$th prime.

Let $a(n)$ be the smallest positive integer such that $p_n$ is a factor of $F_{a(n)}$.

How can I see that it follows that exactly one of $\frac{p_n+1}{a(n)},\frac{p_n}{a(n)},\frac{p_n-1}{a(n)}$ an integer?


Context required by the admins: I observed this fact in numerics up to $n=80$, beyond which it becomes infeasible to continue to evaluate. I looked around and noticed it was stated as a property on OEIS A001177 but no links or citations were provided.

I am interested in knowing how this problem is approached, but I have no formal education in pure maths. This is not homework.