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
)
Given N integers a
1
, a
2
, ... a
N
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: (
Back to comment list
| You must be logged in to post comments.
)
A particular case
Comment 6 of 6 |
Look at perplexus.info/show.php?pid=632 for a particular case of this problem -- and a totally different solution.
Posted by
Old Original Oskar!
on 2005-09-01 16:24:59
Please log in:
Login:
Password:
Remember me:
Sign up!
|
Forgot password
Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ
|
About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
blackjack
flooble's webmaster puzzle
Copyright © 2002 - 2024 by
Animus Pactum Consulting
. All rights reserved.
Privacy Information