Given are $n$ integers. Prove that at least one of the following conditions applies: 1) One of the numbers is a multiple of $n$. 2) You can choose $k\le n$ numbers whose sum is a multiple of $ n$.
Source:
Tags: number theory, multiple, divides
Given are $n$ integers. Prove that at least one of the following conditions applies: 1) One of the numbers is a multiple of $n$. 2) You can choose $k\le n$ numbers whose sum is a multiple of $ n$.