HNHacker News·
Archived topic · source no longer tracked
Formalizing Fermat's Last Theorem
Anthropic's Claude AI has autonomously generated the first complete computer-checked proof of Fermat's Last Theorem (FLT) in the Lean programming language over 11 days. This theorem, originally conjectured by Pierre de Fermat around 1637, states that no positive integers a, b, c satisfy an + bn = cn for any n > 2. The initial proof by Sir Andrew Wiles in 1995 was 129 pages long. This project, the largest Lean proof ever constructed, suggests that collaborative formalization of major mathematical results using consumer AI subscriptions is achievable.
Time & source
Times shown in UTC
Display time zone: UTC
Local time zone unavailable; showing UTC.
IngestedOffset at this time: UTC+0Sep 4, 2026, 20:00 UTC
- Ingested
- Sep 4, 2026, 20:00
- Source type
- Unclassified
- Basis
- Running about 6.9× the median of this source's recent listed items
- Triggering item
- Formalizing Fermat's Last Theorem
- Metric comparison
- 269 vs median 39 (20 baseline samples)
- Detected
- 09/04, 20:00
Full text isn't available here.
Read at source →