All about
flooble

fun stuff

Get a free chatterbox

Free JavaScript

Avatars
perplexus
dot
info
Home
>
Just Math
Find a subset (
Posted on 20050824
)
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: (
You must be logged in to post comments.
)
Subject
Author
Date
A particular case
Old Original Oskar!
20050901 16:24:59
re: Solution
Tristan
20050826 09:22:15
Solution
Tan Kiat Chuan
20050826 04:20:11
No Subject
Josh70679
20050824 22:19:51
re: what is a subset?
Old Original Oskar!
20050824 19:09:05
what is a subset?
Percy
20050824 18:30:13
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 (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
blackjack
flooble's webmaster puzzle
Copyright © 2002  2017 by
Animus Pactum Consulting
. All rights reserved.
Privacy Information