On the divisibility of the rank of appearance of a Lucas sequence
Abstract
Let U = (Un)n ≥ 0 be a Lucas sequence and, for every prime number p, let U(p) be the rank of appearance of p in U, that is, the smallest positive integer k such that p divides Uk, whenever it exists. Furthermore, let d be an odd positive integer. Under some mild hypotheses, we prove an asymptotic formula for the number of primes p ≤ x such that d divides U(p), as x +∞.
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.