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

Home > Just Math
Restoring the erased (Posted on 2010-07-14) Difficulty: 3 of 5
The following text represents a valid contest question
in which I have erased one number :

Let S be a set of 20 distinct positive integers,
each less than EN(=THE ERASED NUMBER).
Show that there exist four distinct elements a, b, c, d , all in S,
such that a + b = c + d.

What maximal value of EN guarantees the existence of these elements ?

No Solution Yet Submitted by Ady TZIDON    
Rating: 4.0000 (5 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: solution for n=12 | Comment 17 of 21 |
(In reply to solution for n=12 by Justin)

Glad to see the target coming into sight!  Is the method (even for 12 terms) still exhaustive search, or is there a more systematic way (beyond Broll's combinatorial formula for a negative result, which for 12 terms would show always two sum pairs equal for 12*11/2 or 66).  Also, since ALL of the numbers must be less than EN, the stated set from 1..72, would affect the case of EN=73, wouldn't it?
  Posted by ed bottemiller on 2010-07-20 11:25:49

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 (18)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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