Divisibility properties of the Fibonacci entry point
classification
🧮 math.NT
keywords
andersonbruckmandensityfibonaccizetaablealgebraicalpha
read the original abstract
For a prime $p$, let $Z(p)$ be the smallest positive integer $n$ so that $p$ divides $F_{n}$, the $n$th term in the Fibonacci sequence. Paul Bruckman and Peter Anderson conjectured a formula for $\zeta(m)$, the density of primes $p$ for which $m | Z(p)$ on the basis of numerical evidence. We prove Bruckman and Anderson's conjecture by studying the algebraic group $G : x^{2} - 5y^{2} = 1$ and relating $Z(p)$ to the order of $\alpha = (3/2,1/2) \in G(\F_{p})$. We are then able to use Galois theory and the Chebotarev density theorem to compute $\zeta(m)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.