{{short description|Can one split the integers into two sets such that every Pythagorean triple spans both?}}
The '''Boolean Pythagorean triples problem''' is a problem from [[Ramsey theory]] about whether the [[natural number|positive integers]] can be colored red and blue so that no [[Pythagorean triple]]s areconsist theof sameall colorred or all blue members. The Boolean Pythagorean triples problem was solved by Marijn Heule, Oliver Kullmann and [[Victor W. Marek]] in May 2016 through a [[computer-assisted proof]].<ref name="nature">{{Cite journal|last=Lamb|first=Evelyn|date=26 May 2016|title=Two-hundred-terabyte maths proof is largest ever|url=http://www.nature.com/news/two-hundred-terabyte-maths-proof-is-largest-ever-1.19990|journal=Nature|doi=10.1038/nature.2016.19990|volume=534|pages=17–18|pmid=27251254|bibcode=2016Natur.534...17L|doi-access=free}}</ref>
