Boolean Pythagorean triples problem: Difference between revisions

Revision as of 05:34, 25 February 2020

Revision as of 05:35, 25 February 2020

Line 1:

The '''Boolean Pythagorean triples problem''' is a problem nick ghur relating to [[Pythagorean triple]]s which was solved using a [[computer-assisted proof]] in May 2016.<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}}</ref>

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 <math>a^2+b^2=c^2</math> are all the same color. For example, in the Pythagorean triple 3, 4 and 5 (<math>3^2+4^2=5^2</math>), if 3 and 4 are colored red, then 5 must be colored blue.