On numbers n dividing the nth term of a linear recurrence
classification
🧮 math.NT
keywords
dividingtermboundscountgivehereintegerslinear
read the original abstract
Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.