MathTensor Lean 4 formalizations of Putnam 2025 problems, with machine-verified Mathlib proofs.
-
Updated
May 21, 2026 - Lean
MathTensor Lean 4 formalizations of Putnam 2025 problems, with machine-verified Mathlib proofs.
Putting the 1992 Putnam Test question A-6 into code.
Solution complète du problème B6 du concours Putnam 2011 — le problème où pas 1 des 3407 candidats a marqué, ne serait-ce, qu'un seul point. Démonstration via l'exponentielle tronquée, racines doubles sur les corps finis et construction auxiliaire G(x) = F(x) - x + x^p.
Autonomous theorem prover combining language-model proof search with Lean 4 verification.
An adversarially-verified compendium: 8 Putnam proofs + 8 open Erdős surveys, built by a 110-agent fleet (Fable conducted, Opus solved/verified, Sonnet typeset).
Solutions to math problems IMO 1986 Q1 and Putnam Exam 2013 B1 in Lean langauge
To associate your repository with the putnam topic, visit your repo's landing page and select "manage topics."