Problem

Source: Czech-Polish-Slovak Junior Match 2013, Individual p2 CPSJ

Tags: Coloring, combinatorics, Sum



Each positive integer should be colored red or green in such a way that the following two conditions are met: - Let $n$ be any red number. The sum of any $n$ (not necessarily different) red numbers is red. - Let $m$ be any green number. The sum of any $m$ (not necessarily different) green numbers is green. Determine all such colorings.