subset of a 100 integer set sums 100

subset of a 100 integer set sums 100 [closed]

-1

I need to prove that every set |A|=100 of integers has a non-empty subset whose sum can be divided by 100. can anyone prove that?

edited Jan 7 2012 at 16:28

Goldstern
5,250●1●12●27

asked Jan 7 2012 at 15:54

David Worth
1

This question is not appropriate for mathoverflow. Please have a look at math.stackexchange.com instead. – Goldstern Jan 7 2012 at 16:26

Not a question for MathOverflow. If you don't find a solution through an Internet search, try working with 6 instead of 100, and try to construct a counterexample with a set of 6 integers. Why does it fail? Gerhard "Ask Me About System Design" Paseman, 2012.01.07 – Gerhard Paseman Jan 7 2012 at 16:32

closed as too localized by Mark Sapir, Kevin Walker, Theo Johnson-Freyd, Bill Johnson, Bruce Westbury Jan 7 2012 at 17:27

Browse other questions tagged elementary co.combinatorics or ask your own question.

question feed