Abstract
Let be a Lucas sequence and, for every prime number , let be the rank of appearance of in , that is, the smallest positive integer such that divides , whenever it exists. Furthermore, let be an odd positive integer. Under some mild hypotheses, we prove an asymptotic formula for the number of primes such that divides , as .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.