All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Find a subset (Posted on 2005-08-24) Difficulty: 3 of 5
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.)

See The Solution Submitted by Federico Kereki    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsA particular caseOld Original Oskar!2005-09-01 16:24:59
re: SolutionTristan2005-08-26 09:22:15
SolutionSolutionTan Kiat Chuan2005-08-26 04:20:11
Some ThoughtsNo SubjectJosh706792005-08-24 22:19:51
Some Thoughtsre: what is a subset?Old Original Oskar!2005-08-24 19:09:05
Questionwhat is a subset?Percy2005-08-24 18:30:13
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
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

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information