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

Home > Just Math
Divisibility (Posted on 2003-03-14) Difficulty: 4 of 5
In any set of 181 square integers, prove that one can always find a subset of 19 numbers, the sum of whose elements is divisible by 19.

See The Solution Submitted by Anoop    
Rating: 3.0000 (8 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: conceptual solution | Comment 5 of 9 |
(In reply to conceptual solution by Cory Taylor)

The fact that they are square integers does insure that they are positive integers, so two integers with the same remainder can't cancel. We'd need pairs with remainders like 17 and 2 to cancel. Of course 19 with the same remainder would bring you back to the start, but then you'd have exhausted your 19.
  Posted by Charlie on 2003-03-17 03:58:40

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information