Can the
set
of all
positive integers
be colored such that each integer is colored either red or blue and all
Pythagorean triples
include at least one integer of each color?
For example, if 3 and 5 were blue, 4 would have to be red since
Note: This problem is not reasonably solvable by hand, but the answer is now known. For a giveaway, see this paper .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!