2024/10/30 by Maciej P. Wojtkowski, Wojtkowski, Maciej P.
Computer Science · #11B37 #11B39 #Advanced Algebra and Logic #FOS: Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2410.22831
openalex publication_date 2024/10/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 =\fracΔ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 \citeL-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 \frac1(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, \citeL, and Ballot, \citeB1,\citeB2,\citeB3, 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.