11:00
Fermat’s two-squares theorem is an elementary theorem in number theory that readily lends itself to a classification of the positive integers representable as the sum of two squares. Given this, a natural question is: what is the minimal number of squares needed to represent any given (positive) integer? One proof of Fermat’s result depends on essentially a buffed pigeonhole principle in the form of Minkowski’s Convex Body Theorem, and this idea can be used in a nearly identical fashion to provide 4 as an upper bound to the aforementioned question (this is Lagrange’s four-square theorem). The question of identifying the integers representable as the sum of three squares turns out to be substantially harder, however leaning on a powerful theorem of Dirichlet and a handful of tricks we can use Minkowski’s CBT to settle this final piece as well (this is Legendre’s three-square theorem).