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?
1 Answer
$\begingroup$
$\endgroup$
2
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.
-
$\begingroup$ I really wanted to pose a question about the independence across consecutive primes too, but was vague...so, I'll mark your answer as correct and open a new question. $\endgroup$– bobuhitoJan 15, 2014 at 21:03
-
1$\begingroup$ We conjecture there is independence across consecutive primes too, but there we can prove very little. $\endgroup$ Jan 15, 2014 at 23:48