Abstract
We speculate on the distribution of primes in exponentially growing, linear recurrence sequences (un)n≥0 in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we guess that either there are only finitely many primes un, or else there exists a constant cu>0 (which we can give good approximations to) such that there are ∼culogN primes un with n≤N, as N→∞. We compare our conjecture to the limited amount of data that we can compile. One new feature is that the primes in our Euler product are not taken in order of their size, but rather in order of the size of the period of the un(modp).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
