Boolean Pythagorean triples problem
id:
boolean-pythagorean-triples-problem-169-12860112
title:
Boolean Pythagorean triples problem
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
Can one split the integers into two sets such that every Pythagorean triple spans both?
original url:
https://en.wikipedia.org/wiki/Boolean_Pythagorean_triples_problem
date created:
2016-05-27T08:33:31Z
date modified:
2024-08-31T15:10:52Z
main entity:
{"identifier":"Q25305453","url":"https://www.wikidata.org/entity/Q25305453"}
image:
fields total:
13
integrity:
15