Prime Numbers, Randomness, and the Gambler's Fallacy

Robert J. Lemke Oliver, Assistant Professor
Tufts University

Friday, September 29, 2017 at 4:30 PM
Kalkin 001

Abstract:

Prime numbers are often said to be ``random'', but, given that primes are deterministic, what does that actually mean? One way in which this randomness manifests is in the last digits of primes: it turns out that each possible last digit is equally likely in a certain strong sense. A similar story holds for the residue class of primes modulo any fixed integer, and this is a well-understood classical theorem of analytic number theory. Surprisingly, however, in joint work with K. Soundararajan, we find that an analogous phenomenon does not hold for patterns of consecutive primes. For example, a string of consecutive primes ending in the digit 1 strongly predisposes the following prime to not end in a 1; thus, prime numbers are subject to the gambler's fallacy. This talk will be aimed at the level of graduate students and non-experts, but should be satisfying to practicing number theorists as well.

ADA: Individuals requiring accommodations, please contact Doreen Taylor at (802) 656-3166

PUBLISHED

09-01-2017
Math Department