Boolean Pythagorean triples problem
Problema del triplete booleano
- Date
- 2016 · confidence high
- Place
- Austin, Texas, United States
- Credited to
- Marijn Heule, Oliver Kullmann, and Victor W. Marek (2016), on a problem associated with Ronald Graham
- Field
- Knowledge & symbols
What was discovered
Ramsey-theory problem asking whether the positive integers can be 2-colored so that no Pythagorean triple is monochromatic; solved in 2016 with a computer-assisted proof showing it is only possible up to the number 7824.
What it led to
- the largest computer-assisted proof to that date (200 terabytes)
- advances in SAT solvers
- renewed interest in computational Ramsey theory
- debate over mathematical proofs unverifiable by hand