2000 character limit reached
On the divisibility of the rank of appearance of a Lucas sequence
Published 28 Aug 2020 in math.NT | (2008.12506v2)
Abstract: Let $U = (U_n)_{n \geq 0}$ be a Lucas sequence and, for every prime number $p$, let $\rho_U(p)$ be the rank of appearance of $p$ in $U$, that is, the smallest positive integer $k$ such that $p$ divides $U_k$, 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 \leq x$ such that $d$ divides $\rho_U(p)$, as $x \to +\infty$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.