All integers from 1 to 2n are written in a row in random order. Then, the position number is added to each number. Prove that among the resulting sums, there must be at least two that leave the same remainder when divided by 2n.
Sign in to check your answer and unlock the solution.