perplexus.info :: Just Math : Remainder of One

Remainder of One (Posted on 2004-12-29)

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: ( You must be logged in to post comments.)

Subject	Author	Date
Erdos Theorum	Michael	2005-04-04 13:40:30
Some Ideas	owl	2005-01-31 05:56:11
re(4): Yet another Erdos theorem	David Shin	2005-01-26 04:48:51
re(3): Yet another Erdos theorem	Richard	2005-01-26 00:04:28
re(2): Yet another Erdos theorem	David Shin	2005-01-25 21:33:38
re: Yet another Erdos theorem	Richard	2005-01-25 20:58:35
re: p <= 5 and more	ken	2005-01-02 00:26:14
p <= 5 and more	Richard	2004-12-31 18:10:49
re: Yet another Erdos theorem	Richard	2004-12-30 17:37:58
Yet another Erdos theorem	e.g.	2004-12-30 13:36:32
re(2): answer?	Bruce Brantley	2004-12-29 22:53:24
re: answer?	David Shin	2004-12-29 21:35:15
answer?	Solomon	2004-12-29 20:40:21

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:


perplexus dot info