Revision as of 07:33, 31 May 2016 edit Magioladitis (talk \| contribs) Extended confirmed users, Rollbackers 908,596 edits m →top: WP:CHECKWIKI error fixes using AWB (12016) ← Previous edit		Revision as of 16:46, 31 May 2016 edit undo Loraof (talk \| contribs) Extended confirmed users 22,850 edits →top: starting cleanup--the sources don't call it a conjecture, but rather a question, and this page doesn't even say what the alleged conjecture is. Next edit →
Line 1: The '''Boolean Pythagorean triples problem''' was a ~~[[conjecture]]~~problem relating to [[Pythagorean triple]]s which was ~~shown to be false~~solved using a [[computer-assisted proof]] in May 2016.<ref>{{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}}</ref> This problem is part of the [[Infinitary combinatorics\|Ramsey theory]] and asks if it is possible to color all the 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 if you would color ''a'' and ''b'' red, and ''c'' blue, this would successfully not satisfy the tested triple, but all triples would have to be tested.

Boolean Pythagorean triples problem: Difference between revisions