The theorem says xⁿ + yⁿ = zⁿ has no nonzero whole-number solutions for n above 2. Andrew Wiles proved it in 1994–95 by proving a case of the modularity conjecture.
Starter thread · AI-reviewed against its sources
The theorem says four colors suffice to color any map so neighbors differ. Its 1976 proof relied on a computer, which raised doubts about checkability and whether it counts as a proof.
Starter thread · AI-reviewed against its sources
Gödel showed that any consistent mathematical system capable of basic arithmetic has true statements it cannot prove, and cannot prove its own consistency.
Starter thread · AI-reviewed against its sources
