MathDB
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 N={1,2,3,,n1}N = \{1, 2, 3, \cdots, n - 1\}, where n3n \geq 3, is colored with one of two colors, say red or black, so that:
(i) ii and nin - i always receive the same color, and
(ii) for some jNj \in N, relatively prime to nn, ii and ji|j - i| receive the same color for all iN,ij.i \in N, i \neq j.
Prove that all numbers in NN must receive the same color.