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.)
Answer incomplete | Comment 2 of 9 |
(In reply to I think I got it by Gamer)

If the original set of 181 squares includes runs of 19 or more consecutive squares, your solution will work. But the problem states "any set of 181 square integers," so you also have to look at the situation where you can't find an unbroken run of 19 consecutive squares.
  Posted by TomM on 2003-03-15 06:18:45

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