Limiting properties of the distribution of primes in an arbitrarily large number of residue classes

Abstract

We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function field analogues developed in the recent years. More precisely, let π(x;q,a) be the number of primes up to x that are congruent to a modulo q. For a fixed integer q and distinct invertible congruence classes a0,a1,…,aD, assuming the generalized Riemann Hypothesis and a weak version of the linear independence hypothesis, we show that the set of x real for which the inequalities π(x;q,a0)>π(x;q,a1)> … >π(x;q,aD) are simultaneously satisfied admits a logarithmic density.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…