combinitorics

Problem Description Let $P$ be a list of players that are queueing up to play a game of League of Legends, if you’re not a nerd feel free to switch this out to be some other team game like soccer or something.

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?