A top hat for Moser's four mathemagical rabbits
Abstract
If the equation 1k+2k+...+(m-2)k+(m-1)k=mk has an integer solution with k>1, then m>10106. Leo Moser showed this in 1953 by remarkably elementary methods. His proof rests on four identities he derives separately. It is shown here that Moser's result can be derived from a von Staudt-Clausen type theorem (an easy proof of which is also presented here). In this approach the four identities can be derived uniformly. The mathematical arguments used in the proofs were already available during the lifetime of Lagrange (1736-1813).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.