The index and its prime divisors

Abstract

We propose a new interpretation of the classical index of appearance for second order linear recursive sequences. It stems from the formula \[ Cn(t)-2 =Qn\ Ln2,\ \ \ where \ \ t= (T2-2Q)/Q, \ = T2-4Q, \] connecting the Chebyshev polynomials of the first kind Cn(x) with the Lucas sequence defined for integer T,Q≠ 0 by the recursion Ln+1= TLn-QLn-1, L0=0, L1 = 1. We build on the results of L-W. We prove that for any prime r≥ 2 the sets j(t,r), j=1,2,…, of primes p such that j is the highest power of r dividing the index of appearance, have prime density equal to 1(r+1)rj-1, for r-generic values of t. We give also complete enumeration of non-generic cases and the appropriate density formulas. It improves on the work of Lagarias, L, and Ballot, B1,B2,B3, on the sets of prime divisors of sequences of "finite order". Our methods are sufficient to prove that for any linear recursive sequence of second order (with some trivial exceptions) the set of primes not dividing any element contains a subset of positive density. We consider also some applications in arithmetic dynamics.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…