Leonhard Euler

After his teatime conversation with Hugh Montgomery, Freeman Dyson wrote this letter to Atle Selberg with references showing that the pair-correlation of the zeros of the zeta function is identical to that of the eigenvalues of a random matrix.

In early April 1972, Hugh Montgomery, who had been a Member in the School of Mathematics the previous year, stopped by the Institute to share a new result with Atle Selberg, a Professor in the School. The discussion between Montgomery and Selberg involved Montgomery’s work on the zeros of the Riemann zeta function, which is connected to the pattern of the prime numbers in number theory. Generations of mathematicians at the Institute and elsewhere have tried to prove the Riemann Hypothesis, which conjectures that the non-trivial zeros (those that are not easy to find) of the Riemann zeta function lie on the critical line with real part equal to 1⁄2.

Montgomery had found that the statistical distribution of the zeros on the critical line of the Riemann zeta function has a certain property, now called Montgomery’s pair correlation conjecture. He explained that the zeros tend to repel between neighboring levels. At teatime, Montgomery mentioned his result to Freeman Dyson, Professor in the School of Natural Sciences.

In the 1960s, Dyson had worked on random matrix theory, which was proposed by physicist Eugene Wigner in 1951 to describe nuclear physics. The quantum mechanics of a heavy nucleus is complex and poorly understood. Wigner made a bold conjecture that the statistics of the energy levels could be captured by random matrices. Because of Dyson’s work on random matrices, the distribution or the statistical behavior of the eigenvalues of these matrices has been understood since the 1960s.

By Richard Taylor 

In modular arithmetic, one thinks of the whole numbers arranged around a circle, like the hours on a clock, instead of along an infinite straight line. Here we have seven “hours” on our clock—arithmetic modulo 7. To add 3 and 5 modulo 7, you start at 0, count 3 clockwise, and then a further 5 clockwise, this time ending on 1. To multiply 3 by 5 modulo 7, you start at 0 and count 3 clockwise 5 times, again ending up at 1.

Modular arithmetic has been a major concern of mathematicians for at least 250 years, and is still a very active topic of current research. In this article, I will explain what modular arithmetic is, illustrate why it is of importance for mathematicians, and discuss some recent breakthroughs.

For almost all its history, the study of modular arithmetic has been driven purely by its inherent beauty and by human curiosity. But in one of those strange pieces of serendipity which often characterize the advance of human knowledge, in the last half century modular arithmetic has found important applications in the “real world.” Today, the theory of modular arithmetic (e.g., Reed-Solomon error correcting codes) is the basis for the way DVDs store or satellites transmit large amounts of data without corrupting it. Moreover, the cryptographic codes which keep, for example, our banking transactions secure are also closely connected with the theory of modular arithmetic. You can visualize the usual arithmetic as operating on points strung out along the “number line.”