Problem #PRU-103964

Problems Number Theory Divisibility Division with remainders. Arithmetic of remainders Arithmetic of remainders Methods Pigeonhole principle Pigeonhole principle (other)

12–14 3.0

Problem

There are $n$ integers. Prove that among them either there are several numbers whose sum is divisible by $n$ or there is one number divisible by $n$ itself.

To see the solution register and get verified.