The Shanks-R\'enyi prime number race with many contestants
Youness Lamzouri

TL;DR
This paper studies the distribution of prime number races with many contestants, showing that the probability of a specific ordering tends to zero as the number of contestants grows, and establishing asymptotic behaviors in different regimes.
Contribution
It extends the understanding of prime number races to large numbers of contestants, proving asymptotic formulas and bounds for the associated densities as the number of contestants increases.
Findings
For r = o(√log q), δ_{q;a_1,...,a_r} ~ 1/r!
When log q ≤ r ≤ φ(q), δ_{q;a_1,...,a_r} ≪ q^{-1+ε}
The densities tend to zero as the number of contestants grows large.
Abstract
Under certain plausible assumptions, M. Rubinstein and P. Sarnak solved the Shanks--R\'enyi race problem, by showing that the set of real numbers such that has a positive logarithmic density . Furthermore, they established that if is fixed, as . In this paper, we investigate the size of these densities when the number of contestants tends to infinity with . In particular, we deduce a strong form of a recent conjecture of A. Feuerverger and G. Martin which states that in this case. Among our results, we prove that in the region as . We also bound the order of magnitude of these densities beyond this range of . For example, we show that when $\log q\leq…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
