MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Dirichlet's theorem shows that, for any fixed prime integer a, "big prime numbers mod a" are uniformly distributed between 1 and a-1. If we similarly pick different prime integers b,c,..., are these uniform distributions independent of each other?

share|cite|improve this question
up vote 1 down vote accepted

Yes (asymptotically of course). The prime number theorem for arithmetic progressions tells us that primes are (asymptotically) uniformly distributed in the $\phi(m)$ reduced residue classes modulo $m$ for any integer $m$, even composite $m$. You can quickly convince yourself that, if $a$ and $b$ are primes, the independence of the uniform distribution of primes modulo $a$ and modulo $b$ is exactly the same thing as the uniform distribution of primes modulo $ab$. The same holds no matter how (finitely) many primes $a,b,c,...$ you use.

share|cite|improve this answer
I really wanted to pose a question about the independence across consecutive primes too, but was, I'll mark your answer as correct and open a new question. – bobuhito Jan 15 '14 at 21:03
We conjecture there is independence across consecutive primes too, but there we can prove very little. – Greg Martin Jan 15 '14 at 23:48

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.