All about
flooble

fun stuff

Get a free chatterbox

Free JavaScript

Avatars
perplexus
dot
info
Home
>
Just Math
Supreme Subset (
Posted on 20140102
)
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.
)
We have a consensus
Comment 6 of 6 
Yes, 3 out of 7 is the best I could come up with also.
2 numbers, 2 blanks, 1 number, 2 blanks, repeat.
or, actually, any of 7 variations:
1100100
1001001
0010011
0100110
1001100
0011001
0110010.
I thought that I could slip an extra number in, taking advantage of the end conditions, but no dice. Maximum elements in S is 300.
Posted by
Steve Herman
on 20140102 15:25:05
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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
blackjack
flooble's webmaster puzzle
Copyright © 2002  2017 by
Animus Pactum Consulting
. All rights reserved.
Privacy Information