The Shanks-Rényi prime number race with many contestants

preprint2011arXivOpen access

Abstract

Under certain plausible assumptions, M. Rubinstein and P. Sarnak solved the Shanks--Rényi race problem, by showing that the set of real numbers x≥2x\geq 2 such that π(x;q,a1)>π(x;q,a2)>...>π(x;q,ar)π(x;q,a_1)>π(x;q,a_2)>...>π(x;q,a_r) has a positive logarithmic density δq;a1,...,arδ_{q;a_1,...,a_r}. Furthermore, they established that if rr is fixed, δq;a1,...,ar→1/r!δ_{q;a_1,...,a_r}\to 1/r! as q→∞q\to \infty. In this paper, we investigate the size of these densities when the number of contestants rr tends to infinity with qq. In particular, we deduce a strong form of a recent conjecture of A. Feuerverger and G. Martin which states that δq;a1,...,ar=o(1)δ_{q;a_1,...,a_r}=o(1) in this case. Among our results, we prove that δq;a1,...,ar∼1/r!δ_{q;a_1,...,a_r}\sim 1/r! in the region r=o(log⁡q)r=o(\sqrt{\log q}) as q→∞q\to\infty. We also bound the order of magnitude of these densities beyond this range of rr. For example, we show that when log⁡q≤r≤ϕ(q)\log q\leq r\leq ϕ(q), δq;a1,...,ar≪εq−1+εδ_{q;a_1,...,a_r}\ll_ε q^{-1+ε}.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.