Difference between revisions of "2024 AMC 10A Problems/Problem 20"
m (LF) |
m (→Solution 3) |
||
(24 intermediate revisions by 2 users not shown) | |||
Line 9: | Line 9: | ||
<math>\textbf{(A) }436 \qquad \textbf{(B) }506 \qquad \textbf{(C) }608 \qquad \textbf{(D) }654 \qquad \textbf{(E) }675</math> | <math>\textbf{(A) }436 \qquad \textbf{(B) }506 \qquad \textbf{(C) }608 \qquad \textbf{(D) }654 \qquad \textbf{(E) }675</math> | ||
− | |||
− | |||
− | |||
==Solution 1== | ==Solution 1== | ||
Line 19: | Line 16: | ||
− | NOTE: | + | '''NOTE:''' |
To prove that this is the best we can do, consider adding each element one by one, for the first element, say n. If n is greater than 2, we can choose n - 2 which is always better. Therefore, n = 1 or n = 2. | To prove that this is the best we can do, consider adding each element one by one, for the first element, say n. If n is greater than 2, we can choose n - 2 which is always better. Therefore, n = 1 or n = 2. | ||
Line 31: | Line 28: | ||
~EaZ_Shadow | ~EaZ_Shadow | ||
+ | |||
+ | ==Solution 3== | ||
+ | |||
+ | We find the following pairs of numbers work: | ||
+ | |||
+ | <cmath>(1,4), (4,8), (8,11), (11,14), (14, 18), (18, 21), (21, 24) \dots</cmath> | ||
+ | |||
+ | Call a number an OE (odd-even) pair if the first number in the pair is odd and the second is even. Do the same for EE (even-even) and EO (even-odd) pairs. Notice that we're adding 10 to the pairs in each set, so there are 404 numbers in each set of pairs '''excluding 1 and 2024:''' | ||
+ | |||
+ | |||
+ | '''OE pairs:''' <cmath>(1,4), (11,14), ... , (2021,2024) \implies (202 + 1) \cdot 2 - 2 = 404</cmath> | ||
+ | |||
+ | |||
+ | '''EE pairs:''' <cmath>(4,8), (14,18), ..., (2014,2018) \implies (201 + 1) \cdot 2 = 404</cmath> | ||
+ | |||
+ | |||
+ | '''EO pairs:''' <cmath>(8,11), (18,21), ..., (2018, 2021) \implies (201 + 1) \cdot 2 = 404</cmath> | ||
+ | |||
+ | |||
+ | Every number besides <math>1</math> and <math>2024</math> is being overcounted twice (for example, <math>4</math> is counted twice in the EE and OE pairs), so we have <math>404 \cdot \frac{3}{2} = 606.</math> Finally, we add <math>2</math> (adding back <math>1</math> and <math>2024</math>) to get <math>\boxed{\textbf{(C) }608}</math>. | ||
+ | |||
+ | ~[https://artofproblemsolving.com/wiki/index.php/User:grogg007 grogg007] | ||
== Video Solution by Power Solve == | == Video Solution by Power Solve == | ||
Line 42: | Line 61: | ||
==Video Solution by SpreadTheMathLove== | ==Video Solution by SpreadTheMathLove== | ||
https://youtu.be/BhiczrT7Sg0?si=XnkHOJl5n9SWHsfc | https://youtu.be/BhiczrT7Sg0?si=XnkHOJl5n9SWHsfc | ||
+ | |||
+ | ==Video Solution 3 by [https://artofproblemsolving.com/wiki/index.php/User:grogg007 grogg007] (5 mins ⏩)== | ||
+ | https://youtu.be/rFU5EW9VOq8 | ||
+ | |||
+ | ==Video Solution by Scholars Foundation== | ||
+ | https://www.youtube.com/watch?v=FKOqZau--5w&t=1s | ||
==See also== | ==See also== | ||
{{AMC10 box|year=2024|ab=A|num-b=19|num-a=21}} | {{AMC10 box|year=2024|ab=A|num-b=19|num-a=21}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
+ | [[Category:Intermediate Combinatorics Problems]] |
Latest revision as of 21:52, 12 August 2025
Contents
Problem
Let be a subset of
such that the following two conditions hold:
- If
and
are distinct elements of
, then
- If
and
are distinct odd elements of
, then
What is the maximum possible number of elements in ?
Solution 1
All lists are organized in ascending order:
By listing out the smallest possible elements of subset we can find that subset
starts with
It is easily noticed that the elements of the subset "loop around" every 3 elements, specifically adding 10 each time. This means that there will be
or
whole loops in the subset
implying that there will be
elements in S. However, we have undercounted, as we did not count the remainder that resulted from
With a remainder of
we can fit
more elements into the subset
namely
and
resulting in a total of
or
elements in subset
.
NOTE:
To prove that this is the best we can do, consider adding each element one by one, for the first element, say n. If n is greater than 2, we can choose n - 2 which is always better. Therefore, n = 1 or n = 2.
If n = 2 was optimal, then choose it, then the set of usable numbers in becomes 5 through 2024. We can transform the usable set of
to
where
contains the numbers 1 through 2020. Because we assumed n = 2 was optimal, we can choose n = 2 for the set
too. Because every element in
is 4 below the elements of
, choosing 2 in
would mean choosing 6 in set
. By induction we see that our list would be {2,6,10,14,18,.....2022} which only gives 506 elements which is sub-optimal. Therefore, we can conclude that n = 1 is optimal, and we proceed as the solution above.
-weihou0
Solution 2
Notice that we can first place odd numbers, then place even numbers between each pair. We can start at and continue from there. Realize that the smallest number
such that
reproduces odd number is
. The next ones are
. We can proceed to find the number of numbers in this particular sequence. From the equation
, we get that
works, so this means there is 253 solutions. Looking at
we can see that there could only be 1 possible number between each pair, yielding
. Then see that we can fit two more into the number count since the set
to
can fit two evens. Now this means
and
don’t work. Now test out
. Using the same method, we get that
is the maximum number in the set. Everything above
doesn’t work, as we can split it down into smaller subgroups, so the answer is
.
~EaZ_Shadow
Solution 3
We find the following pairs of numbers work:
Call a number an OE (odd-even) pair if the first number in the pair is odd and the second is even. Do the same for EE (even-even) and EO (even-odd) pairs. Notice that we're adding 10 to the pairs in each set, so there are 404 numbers in each set of pairs excluding 1 and 2024:
OE pairs:
EE pairs:
EO pairs:
Every number besides and
is being overcounted twice (for example,
is counted twice in the EE and OE pairs), so we have
Finally, we add
(adding back
and
) to get
.
Video Solution by Power Solve
https://www.youtube.com/watch?v=NZ0SBMqeAfg
Video Solution by Pi Academy
https://youtu.be/fW7OGWee31c?si=oq7toGPh2QaksLHE
Video Solution by SpreadTheMathLove
https://youtu.be/BhiczrT7Sg0?si=XnkHOJl5n9SWHsfc
Video Solution 3 by grogg007 (5 mins ⏩)
Video Solution by Scholars Foundation
https://www.youtube.com/watch?v=FKOqZau--5w&t=1s
See also
2024 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 19 |
Followed by Problem 21 | |
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 10 Problems and Solutions |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.