SMRTR summary
Mathematicians long believed multiplying large numbers couldn't be done faster than O(n²) steps, until a 23-year-old student disproved that in 1960 using a clever algebraic trick. In 2019, a new algorithm pushed efficiency to O(n log n), but proving this is the absolute speed limit remains unsolved.
SMRTR provides this summary for quick context. The original article belongs to Lobsters.
Read the original articleThis archive is built from SMRTR newsletter stories. Subscribe for hand-picked stories without the extra noise.
Hector Pasten, a mathematician at the Pontifical Catholic University of Chile, solved a long-standing problem in number theory while procrastinating on writing a final exam. He...
A significant mathematical problem extending Hilbert's 10th problem has been solved. Two independent teams proved that for many number systems beyond integers, no general...
Benjamin Bedert, an Oxford graduate student, solved a 60-year-old math problem by Paul Erdős regarding sum-free sets. Erdős questioned the prevalence of sum-free sets within...
AI models solved five of six International Mathematical Olympiad problems in July 2025, surprising mathematicians with their rapid progress. However, this performance doesn't...
Andrew Wiles spent his career solving Fermat's Last Theorem, a 300-year-old problem he first encountered at age 10. After seven years of secret work, he announced a proof in 1993,...
A UNSW mathematician has discovered a new method to solve higher polynomial equations, a longstanding challenge in algebra. The approach uses novel number sequences and avoids...