Divisibility properties of the Fibonacci entry point
Abstract
For a prime p, let Z(p) be the smallest positive integer n so that p divides Fn, the nth term in the Fibonacci sequence. Paul Bruckman and Peter Anderson conjectured a formula for ζ(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 : x2 - 5y2 = 1 and relating Z(p) to the order of α = (3/2,1/2) ∈ G(p). We are then able to use Galois theory and the Chebotarev density theorem to compute ζ(m).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.