Abstract
We give a detailed analysis of a probabilistic heuristic model for the failure of “saturation” in instances of the Affine Sieve having toral Zariski closure. Based on this model, we formulate precise conjectures on several classical problems of arithmetic interest and test these against empirical data.
Acknowledgments
The authors thank Jonathan Bober, Andrew Granville, Peter Sarnak, and Alireza Salehi Golsefidy for enlightening discussions, comments, and suggestions, and most of all, Danny Krashen and Sean Irvine for the highly nontrivial and time-consuming task of computing Ω for Lucas, Fibonacci, and Mersenne numbers from cumbersome online databases of their factorizations.
Notes
1 One can work more generally with entries in the ring of S-integers but we restrict to
for ease of exposition. Note that there exist
for which no vector
gives an integral orbit, e.g.,
with
2 Recall that this Zariski closure can be thought of as the common zero set of all polynomials inside affine space
that vanish on
3 We need not assume any restriction on the orbit like “primitivity” (that the ) since the fixed prime factors, if any, can be accounted for in the value of R.
4 For example,
5 For example, in the normal order sense of the [CitationHardy and Ramanujan 17] theorem, further refined in the Erdős-Kac theorem.
6 The probable primality of was found by T. D. Noe while that of
by de Water; see OEIS for further credits. Both numbers have passed numerous pseudoprimality tests. Assuming GRH, one would need to run about
trials (that is,
tests at a cost of
each, ignoring epsilons) of the Miller primality test to certify these entries prime. Unconditionally, the exponent 4 would be replaced by a 6, see [CitationLenstra and Pomerance 11]. One could alternatively try the elliptic curve primality test, which is also unconditional and in practice runs faster, though a worst-case execution time is currently unknown.
7 In some very special cases, one can completely determine sets like ΣFL. Indeed, see [CitationBober et al. 09], where all solutions to with
are effectively listed.