A set S of n−1 natural numbers is given (n≥3). There exist at least at least two elements in this set whose difference is not divisible by n. Prove that it is possible to choose a non-empty subset of S so that the sum of its elements is divisible by n. pigeonhole principlenumber theory unsolvednumber theory