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

Home > Just Math
Must differ by 3 (Posted on 2015-10-23) Difficulty: 2 of 5
Let S consist of 16 elements of the set (1,2,3, ... , 106) so that no two elements of S differ by 6; 9; 12; 15; 18; or 21.

Prove that at least two of the elements of S must differ by 3.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: analytic solution Comment 3 of 3 |
(In reply to analytic solution by Paul)

Very nicely done, Paul.  In fact, you have proved a stronger statement, namely that this is true if 16 elements were picked from (1,2,3,...,120).  I wonder why the puzzle author used a smaller set. 
  Posted by Steve Herman on 2015-10-27 11:26: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 (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information