In 1971, David Singmaster conjectured that any natural number greater than one only appears in Pascal’s triangle a bounded number of times. In the talk I will discuss what is known about this conjecture, concentrating on a recent result in joint work with Maksym Radziwill, Xuancheng Shao, Terence Tao, and Joni Teräväinen that establishes the conjecture in the interior region of Pascal’s triangle.
While the problem is combinatorial, we use number theoretic and analytic tools. In particular an important analytic input in our proof is Vinogradov’s estimate for exponential sums over primes.
This video is part of the Webinar in Additive Combinatorics series, and this is their YouTube channel.
