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

Home > Just Math
Remainder of One (Posted on 2004-12-29) Difficulty: 4 of 5
Let p be a prime. Let S be a set of (p-1) integers, none of which are divisible by p. Show that some subset of S has a sum that has a remainder of 1 when divided by p.

(The sum of a set is defined as the sum of the elements of the set)

See The Solution Submitted by David Shin    
Rating: 3.8750 (8 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re(4): Yet another Erdos theorem | Comment 11 of 13 |
(In reply to re(3): Yet another Erdos theorem by Richard)

Yes, you did clearly indicate that you had not solved the problem, I was just worried that you thought that the product-problem was somehow related to the sum-problem, which I don't believe is the case.

As far as the difficulty level goes, it is hard to judge the difficulty of a problem when you already know the solution.  Perhaps this should be a difficulty level 5 problem. 

By the way, I am proud to say that this is an original problem. 


  Posted by David Shin on 2005-01-26 04:48:51
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 (8)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information