ramsey theory

Problem Description The Pythagorean Triples Coloring Problem1 takes in the set of all integers from $1\leq k\leq n$ for some value of $n$ and asks the question, is it possible to assign a color to every value in our set, such that no set of pythagorean triples is all the same color?