2012 AMC 12A Problems/Problem 17

Revision as of 14:48, 12 February 2012 by Gina (talk | contribs) (Created page with "== Problem == Let <math>S</math> be a subset of <math>\{1,2,3,\dots,30\}</math> with the property that no pair of distinct elements in <math>S</math> has a sum divisible by <mat...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $S$ be a subset of $\{1,2,3,\dots,30\}$ with the property that no pair of distinct elements in $S$ has a sum divisible by $5$. What is the largest possible size of $S$?

$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 13\qquad\textbf{(C)}\ 15\qquad\textbf{(D)}\ 16\qquad\textbf{(E)}\ 18$

Solution

Of the integers from $1$ to $30$, there are six each of $0,1,2,3,4\ (\text{mod}\ 5)$. We can create several rules to follow for the elements in subset $S$. No element can be $1\ (\text{mod}\ 5)$ iff there is an element that is $4\ (\text{mod}\ 5)$. No element can be $2\ (\text{mod}\ 5)$ iff there is an element that is $3\ (\text{mod}\ 5)$. Ignoring those that are $0\ (\text{mod}\ 5)$, we can get a subset $S$ with $12$ elements. Considering $0\ (\text{mod}\ 5)$, there can be one element that is so because it will only be divisible by $5$ if paired with another element that is $0\ (\text{mod}\ 5)$. The final answer is $\boxed{\textbf{(B)}\ 13}$.


See Also

2012 AMC 12A (ProblemsAnswer KeyResources)
Preceded by
Problem 16
Followed by
Problem 18
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 12 Problems and Solutions