Abstract: It is not hard to show that there are infinitely many pairs of consecutive integers that are sums of two squares. The question about large gaps between sums of two squares is much more difficult. In this talk I want to report on recent joint work with Christian Elsholtz, Alexander Kalmynin, Sergei Konyagin and James Maynard which makes progress on this and related problems, in particular improving an old record of Richards from 1982.
Link to slides: drive.google.c...
Number Theory Web Seminar: www.ntwebsemin...
Original air date:
Thursday, May 30, 2024 (8am PDT, 11am EDT, 4pm BST, 5pm CEST, 6pm Israel Daylight Time, 8:30pm Indian Standard Time, 11pm CST)
Friday, May 31, 2024 (1am AEST, 3am NZST)