# Boolean Pythagorean triples problem

The Boolean Pythagorean triples problem is a problem relating to Pythagorean triples which was solved using a computer-assisted proof in May 2016.[1]

This problem is from Ramsey theory and asks if it is possible to color each of the positive integers either red or blue, so that no Pythagorean triple of integers a, b, c, satisfying ${\displaystyle a^{2}+b^{2}=c^{2}}$ are all the same color. For example, in the Pythagorean triple 3, 4 and 5 (${\displaystyle 3^{2}+4^{2}=5^{2}}$), if 3 and 4 are colored red, then 5 must be colored blue.

Marijn Heule, Oliver Kullmann and Victor Marek investigated the problem, and showed that such a coloring is only possible up to the number 7824. The actual statement of the theorem proved is

Theorem   The set {1, . . . , 7824} can be partitioned into two parts, such that no part contains a Pythagorean triple, while this is impossible for {1, . . . , 7825}.[2]

There are 27825 ≈ 3.63×102355 colorings for the numbers up to 7825. These possible colorings were logically and algorithmically narrowed down to around a trillion (still highly complex) cases, and those were examined using a Boolean satisfiability solver. Creating the proof took about 4 CPU-years of computation over a period of two days on the Stampede supercomputer at the Texas Advanced Computing Center and generated a 200 terabyte propositional proof, which was compressed to 68 gigabytes.

The paper describing the proof was published on arXiv on 3 May 2016,[2] and has been accepted for the SAT 2016 conference, where it won the best paper award.[3]

In the 1980s Ronald Graham offered a \$100 prize for the solution of the problem, which has now been awarded to Marijn Heule.[1]