Boolean Pythagorean triples problem
The Boolean Pythagorean triples problem is a problem from Ramsey theory about whether the positive integers can be colored red and blue so that no Pythagorean triples consist of all red 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.
Link from a Wikipage to another Wikipage
primaryTopic
Boolean Pythagorean triples problem
The Boolean Pythagorean triples problem is a problem from Ramsey theory about whether the positive integers can be colored red and blue so that no Pythagorean triples consist of all red 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.
has abstract
The Boolean Pythagorean triple ...... ugh a computer-assisted proof.
@en
Wikipage page ID
50,650,284
page length (characters) of wiki page
Wikipage revision ID
1,014,213,644
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
The Boolean Pythagorean triple ...... ugh a computer-assisted proof.
@en
label
Boolean Pythagorean triples problem
@en