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

Home > Just Math
Supreme Subset (Posted on 2014-01-02) Difficulty: 3 of 5
Let us define the set T = {1,2,3,...,700}. Now, S is a subset of T such that no two numbers in S differ by a difference of 2 or 5.

Determine the largest number of elements that S can have.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution re: Blindly crossing possible solution | Comment 5 of 6 |
(In reply to Blindly crossing possible solution by Jer)

This agrees with my analysis in which the "keeping" or "discarding" pattern is 11001001100100...

Trying to get to the end and reverse this doesn't seem to allow a mesh with this forward sequence from the start and so it seems 300 is the highest possible.

  Posted by Charlie on 2014-01-02 15:14:37
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 (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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