# Ordering random variables and racing prime numbers

If you have a question about this talk, please contact Perla Sousi.

The prime number race’’ is the competition between different coprime residue classes mod $q$ to contain the most primes, up to a point $x$. Rubinstein and Sarnak showed, assuming two number theory conjectures, that as $x$ varies the problem is equivalent to a problem about orderings of approximately Gaussian random variables, having weak correlations coming from number theory. In particular, as $q \rightarrow \infty$ the number of primes in any fixed set of $r$ coprime classes will achieve any given ordering for $\sim 1/r!$ values of $x$. I will try to explain what happens when $r$ is allowed to grow as a function of $q$. It turns out that one still sees uniformity of orderings in many situations, but not always. The proofs involve various probabilistic ideas, and also some harmonic analysis related to the Hardy—Littlewood method. This is joint work with Youness Lamzouri.

This talk is part of the Probability series.

Tell a friend about this talk:

## This talk is included in these lists:

Note that ex-directory lists are not shown.

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity