home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!sdd.hp.com!uakari.primate.wisc.edu!usenet.coe.montana.edu!ogicse!das-news.harvard.edu!husc-news.harvard.edu!tara!fry
- From: fry@tara.harvard.edu (David Fry)
- Newsgroups: sci.math
- Subject: Re: A Divisibility Problem
- Message-ID: <1992Jul27.005128.14212@husc3.harvard.edu>
- Date: 27 Jul 92 04:51:28 GMT
- References: <9207270341.AA10422@.euclid.uoregon.edu.>
- Organization: Harvard Math Department
- Lines: 32
- Nntp-Posting-Host: tara.harvard.edu
-
- In article <9207270341.AA10422@.euclid.uoregon.edu.> s42234@DUCVAX.AUBURN.EDU (M Johnson) writes:
- >
- >HI, I encountered a problem relating to the divisibility of a sum of integers
- >as follows, and I wonder whether the following is true:
- >
- >Given N > 1 positive integers, it is always possible to find a subset of
- >of the set of N positive integers such that its sum is divisible by N.
- >
- >
- >Is this true? Thanks for your answer.
-
- I hope this isn't a homework problem, but...
-
- This is true. Imagine adding the numbers up one by one, and writing
- down, after adding each number, the remainder left over when you divide
- the running sum by N.
-
- 1) If you ever get a remainder of 0, then you've found a subset that
- is divisible by N. Suppose that this never happens.
-
- 2) If you ever write down a remainder that you've written down before,
- then you must have in the meantime added a subset that is divisible
- by N. Suppose that this never happens.
-
- Then, when you finish, you must have written down N distinct remainders
- (numbers between 0 and N-1), none of which is 0. This is impossible,
- so one of 1) or 2) must have happened.
-
- David Fry fry@math.harvard.EDU
- Division of Applied Sciences fry@huma1.bitnet
- Harvard University ...!harvard!huma1!fry
- Cambridge, MA 02138
-