Home > Just Math
| Find a subset (Posted on 2005-08-24) |
 |
Given N integers a1, a2, ... aN prove there exists a (non empty) subset whose sum is a multiple of N. (Allow repeated numbers in both the original set and its subsets.)
re: Solution
|
 | Comment 5 of 6 | 
|
(In reply to Solution by KC)
Nice!
|
|
Posted by Tristan
on 2005-08-26 09:22:15 |
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|
