1992 AHSME Problems/Problem 23

Revision as of 23:28, 18 February 2012 by Ckorr2003 (talk | contribs) (Created page with "Let <math>S</math> be a subset of <math>\{1,2,3,...,50\}</math> such that no pair of distinct elements in <math>S</math> has a sum divisible by <math>7</math>. What is the maximu...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Let $S$ be a subset of $\{1,2,3,...,50\}$ such that no pair of distinct elements in $S$ has a sum divisible by $7$. What is the maximum number of elements in $S$?