BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Wooter van Doorn (Netherlands)
DTSTART:20261105T200000Z
DTEND:20261105T210000Z
DTSTAMP:20261107T163505Z
UID:NYNTS/8
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/NYNTS/8/">Sh
 ort Egyptian fractions</a>\nby Wooter van Doorn (Netherlands) as part of N
 ew York Number Theory Seminar\n\n\nAbstract\nGiven a fraction $a/b \\in (0
 \, 1)$\, write it as a sum of distinct unit fractions. What is the least n
 umber of unit fractions you need? Over $75$ years ago\, Erd\\H{o}s conject
 ured that $O(\\log \\log b)$ unit fractions always suffices\, which would 
 be optimal if true. This conjecture was recently proven by an internal mod
 el of OpenAI\, and in this talk we aim to explain a simplified version of 
 the proof\, which was obtained in joint work with Thomas Bloom.\n
LOCATION:https://researchseminars.org/talk/NYNTS/8/
END:VEVENT
END:VCALENDAR