A proof of the Erdős primitive set conjecture

Jared D. Lichtman
Université d'Oxford, Royaume-Uni

Date(s) : 01/12/2022   iCal
14 h 00 min - 15 h 00 min

A set of integers greater than 1 is primitive if no member in the set divides another. Erdős proved in 1935 that the sum of 1/(a log a), ranging over a in A, is uniformly bounded over all choices of primitive sets A. In 1988 he asked if this bound is attained for the set of prime numbers. In this talk we describe recent work which answers Erdős’ conjecture in the affirmative. We will also discuss applications to old questions of Erdős, Sárközy, and Szemerédi from the 1960s.


Site Sud, Luminy, Ancienne BU, Salle Séminaire2 (RdC)


Retour en haut 

Secured By miniOrange