All numbers in N must receive the same color
Source:
August 29, 2010
modular arithmeticnumber theoryrelatively primecombinatoricsIMOIMO 1985Coloring
Problem Statement
Each of the numbers in the set , where , is colored with one of two colors, say red or black, so that:(i) and always receive the same color, and(ii) for some , relatively prime to , and receive the same color for all Prove that all numbers in must receive the same color.