Boolean Pythagorean triples problem: Difference between revisions

Revision as of 01:35, 31 December 2020

Revision as of 09:25, 8 March 2021

Line 8:

==Solution==

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

{{math 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}.<ref name="arXiv"/>}}