On the index of appearance of a Lucas sequence

Abstract

Let u = (un)n ≥ 0 be a Lucas sequence, that is, a sequence of integers satisfying u0 = 0, u1 = 1, and un = a1 un - 1 + a2 un - 2 for every integer n ≥ 2, where a1 and a2 are fixed nonzero integers. For each prime number p with p 2a2Du, where Du := a12 + 4a2, let u(p) be the rank of appearance of p in u, that is, the smallest positive integer k such that p uk. It is well known that u(p) exists and that p (Du p ) u(p), where (Du p ) is the Legendre symbol. Define the index of appearance of p in u as u(p) := (p - (Du p )) / u(p). For each positive integer t and for every x > 0, let Pu(t, x) be the set of prime numbers p such that p ≤ x, p 2a2 Du, and u(p) = t. Under the Generalized Riemann Hypothesis, and under some mild assumptions on u, we prove that equation* \#Pu(t, x) = A\, Fu(t) \, Gu(t) \, x x + Ou\!(x( x)2 + x (2 x)(t) ( x)2) , equation* for all positive integers t and for all x > t3, where A is the Artin constant, Fu(·) is a multiplicative function, and Gu(·) is a periodic function (both these functions are effectively computable in terms of u). Furthermore, we provide some explicit examples and numerical data.

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…