"Let S be a set of n pair-wise distinct positive integers. Prove that there exists a subset T in S, such that the sum of elements in T is divisible by n."
For example, suppose we have 5 numbers:
3,6,11,8,7
Then we have 7+3=10 which is divisible by 5

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Actually this question is of @Traxter

Is MY solution correct?

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.