Abstract
Chebyshev was the first to observe a bias in the distribution of primes in residue classes. The general phenomenon is that if is a nonsquare\mod q and is a square\mod q, then there tend to be more primes congruent to than in initial intervals of the positive integers; more succinctly, there is a tendency for to exceed . Rubinstein and Sarnak defined to be the logarithmic density of the set of positive real numbers for which this inequality holds; intuitively, is the "probability" that when is "chosen randomly". In this paper, we establish an asymptotic series for that can be instantiated with an error term smaller than any negative power of . This asymptotic formula is written in terms of a variance that is originally defined as an infinite sum over all nontrivial zeros of Dirichlet -functions corresponding to characters\mod q; we show how can be evaluated exactly as a finite expression. In addition to providing the exact rate at which converges to as grows, these evaluations allow us to compare the various density values as and vary modulo ; by analyzing the resulting formulas, we can explain and predict which of these densities will be larger or smaller, based on arithmetic properties of the residue classes and . For example, we show that if is a prime power and is not, then for all but finitely many moduli for which both and are nonsquares. Finally, we establish rigorous numerical bounds for these densities and report on extensive calculations of them.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.