Prime divisors of the Lagarias sequence
Abstract
For integer a let us consider the sequence Xa=x0,x1,x2,... defined by x0=a, x1=1 and, for n>=1, xn+1=xn+xn-1. We say that a prime p divides Xa if p divides at least one term of the sequence. It is easy to see that every prime p divides X1, the sequence of Fibonacci numbers. Lagarias, using a technique involving the computation of degrees of various Kummerian extensions first employed by Hasse, showed in 1985 that X2, the set of primes dividing some Lucas number has natural density 2/3 and posed as a challenge finding the density of prime divisors of X3. In this paper we resolve this challenge, assuming GRH, by showing that the density of X3 equals 1573727S/1569610, with S the so called Stephens constant. This is the first example of a `non-torsion' second order recurrent sequence with irreducible recurrence relation for which we can determine the associated density of prime divisors.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.