Difference between revisions of "1989 AIME Problems/Problem 13"
m |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | Let <math>S^{}_{}</math> be a subset of <math>\{1,2,3^{}_{},\ldots,1989\}</math> such that no two members of <math>S^{}_{}</math> differ by <math>4^{}_{}</math> or <math>7^{}_{}</math>. What is the largest number of elements <math>S^{}_{}</math> can have? | ||
== Solution == | == Solution == | ||
| + | {{solution}} | ||
== See also == | == See also == | ||
| + | * [[1989 AIME Problems/Problem 14|Next Problem]] | ||
| + | * [[1989 AIME Problems/Problem 12|Previous Problem]] | ||
* [[1989 AIME Problems]] | * [[1989 AIME Problems]] | ||
Revision as of 23:20, 24 February 2007
Problem
Let 
be a subset of 
such that no two members of differ by 
or 
. What is the largest number of elements can have?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
