home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!usc!sdd.hp.com!cs.utexas.edu!rutgers!igor.rutgers.edu!remus.rutgers.edu!clong
- From: clong@remus.rutgers.edu (Chris Long)
- Newsgroups: sci.math
- Subject: Re: A Divisibility Problem
- Message-ID: <Jul.28.03.28.02.1992.26857@remus.rutgers.edu>
- Date: 28 Jul 92 07:28:03 GMT
- References: <9207270341.AA10422@.euclid.uoregon.edu.>
- Organization: Rutgers Univ., New Brunswick, N.J.
- Lines: 15
-
- In article <9207270341.AA10422@.euclid.uoregon.edu.>, M Johnson writes:
-
- > 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.
-
- Consider the succesive results mod N of adding the numbers together;
- by the pigeonhole principle either two are equal mod N or one is 0.
- If the latter, we are done, if the former, it is clear that sum of
- elements that are in one and not the other equals 0 mod N.
- --
- Chris Long, 265 Old York Rd., Bridgewater, NJ 08807-2618
-
- "In a study of schoolboys, an educator discovered a correlation between size
- of feet and quality of handwriting. The boys with the larger feet were,
- on the average, older." Wallis & Roberts, _The Nature of Statistics_
-