Jared Duker Lichtman: A proof of the Erdős primitive set conjecture (NTWS 149)
Channel: Number Theory Web Seminar
Date: 2023-05-19

Abstract: 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 1986 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.

Number Theory Web Seminar: https://www.ntwebseminar.org

Original air date: 
Thursday, November 24, 2022 (8am PST, 11am EST, 4pm GMT, 5pm CET, 6pm Israel Standard Time, 9:30pm Indian Standard Time)
Friday, November 25, 2022 (12am CST, 3am AEDT, 5am NZDT)