Erdős' primitive set conjecture

18 November 2019
Jared Duker Lichtman

A subset of the integers larger than 1 is called $\textit{primitive}$ if no member divides another. Erdős proved in 1935 that the sum of $1/(n \log n)$ over $n$ in a primitive set $A$ is universally bounded for any choice of $A$. In 1988, he famously asked if this universal bound is attained by the set of prime numbers. In this talk we shall discuss some recent progress towards this conjecture and related results, drawing on ideas from analysis, probability, & combinatorics.

  • Junior Number Theory Seminar