2
$\begingroup$

Given any seventeen integers, show that there is at least one subset of nine integers whose sum is divisible by $9$.


(one of my friend suggest me) may be this theorem helpful

Theorem: Given any $2n-1$ integers, there is at least one subset of $n$ integers whose sum is divisible by $n$.

and also Fermat’s Little Theorem can be used

  • 0
    @ Aseem Dua may be....2012-11-24

1 Answers 1

3

Here is a generalization of the problem to which you are referring, namely the fact that given any $2n-1$ integers there exists a subset of $n$ integers divisible by $n$. Applying the theorem to the case of $n=9$ provides the desired result.