Difference between revisions of "1992 AHSME Problems/Problem 23"
Noobatmath1 (talk | contribs) (→Problem) |
Tecilis459 (talk | contribs) m (Fix title) |
||
Line 1: | Line 1: | ||
− | ==Problem== | + | ==Problem== |
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 maximum number of elements in <math>S</math>? | 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 maximum number of elements in <math>S</math>? |
Latest revision as of 13:25, 16 July 2024
Problem
Let be a subset of
such that no pair of distinct elements in
has a sum divisible by
. What is the maximum number of elements in
?
Solution
The fact that is assumed as common knowledge in this answer.
First, note that there are possible numbers that are equivalent to
, and there are
possible numbers equivalent to each of
-
.
Second, note that there can be no pairs of numbers and
such that
mod
, because then
. These pairs are
,
,
, and
. Because
is a pair, there can always be
number equivalent to
, and no more.
To maximize the amount of numbers in S, we will use number equivalent to
,
numbers equivalent to
, and
numbers equivalent to
-
. This is obvious if you think for a moment. Therefore the answer is
numbers.
See also
1992 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 22 |
Followed by Problem 24 | |
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 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.