Papers
Topics
Authors
Recent
Search
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$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.