Each of the numbers in the set N={1,2,3,⋯,n−1}, where n≥3, is colored with one of two colors, say red or black, so that:(i) i and n−i always receive the same color, and(ii) for some j∈N, relatively prime to n, i and ∣j−i∣ receive the same color for all i∈N,i=j.Prove that all numbers in N must receive the same color. modular arithmeticnumber theoryrelatively primecombinatoricsIMOIMO 1985Coloring