Difference between revisions of "2024 AMC 10A Problems/Problem 18"
m (→Video Solution by grogg007) |
Pinotation (talk | contribs) (→Solution 4) |
||
(17 intermediate revisions by 4 users not shown) | |||
Line 7: | Line 7: | ||
==Solution 1== | ==Solution 1== | ||
− | <math>2b^3+2b+4\equiv 0\pmod{16}\implies b^3+b+2\equiv 0\pmod 8</math>, if <math>b</math> even then <math>b+2\equiv 0\pmod 8\implies b\equiv 6\pmod 8</math>. If <math>b</math> odd then <math>b^2\equiv 1\pmod 8\implies b^3+b+2\equiv 2b+2\pmod 8</math> so <math>2b+2\equiv 0\pmod 8\implies b+1\equiv 0\pmod 4\implies b\equiv 3,7\pmod 8</math>. Now <math>8\mid 2024</math> so <math>\frac38\cdot 2024=759</math> but one of the answers we got from that, <math>3</math>, is too small, so <math>759 - 1 = 758\implies\boxed{\textbf{(D) }20}</math>. | + | <math>2b^3+2b+4\equiv 0\pmod{16}\implies b^3+b+2\equiv 0\pmod 8</math>, if <math>b</math> is even then <math>b+2\equiv 0\pmod 8\implies b\equiv 6\pmod 8</math>. If <math>b</math> is odd then <math>b^2\equiv 1\pmod 8\implies b^3+b+2\equiv 2b+2\pmod 8</math> so <math>2b+2\equiv 0\pmod 8\implies b+1\equiv 0\pmod 4\implies b\equiv 3,7\pmod 8</math>. Now <math>8\mid 2024</math> so <math>\frac38\cdot 2024=759</math> but one of the answers we got from that, <math>3</math>, is too small, so <math>759 - 1 = 758\implies\boxed{\textbf{(D) }20}</math>. |
~OronSH ~[[User:Mathkiddus|mathkiddus]] ~andliu766 ~megaboy6679 ~trevian1(minor edit for clarity) | ~OronSH ~[[User:Mathkiddus|mathkiddus]] ~andliu766 ~megaboy6679 ~trevian1(minor edit for clarity) | ||
Line 96: | Line 96: | ||
take away one because <math>b=3</math> is out of range, so <math>758\Rightarrow7+8+5=\boxed{\text{(D) }20}</math> | take away one because <math>b=3</math> is out of range, so <math>758\Rightarrow7+8+5=\boxed{\text{(D) }20}</math> | ||
+ | ===Solution 4.1: Alternate Ending=== | ||
− | ==Video Solution by | + | One can arrange 2024 into different "blocks" consisting of 8 numbers each, particularly \( \{0,1,2,3,4,5,6,7\} \), \( \{8,9,10,11,12,13,14,15\} \) ... |
+ | |||
+ | These just represent different \( \mod(8) \) class residues. So, you can just divide 2024 by 8 blocks giving us 253 total blocks with 0 extra semi-blocks. | ||
+ | |||
+ | We see that \( 2024_3 \mod 8 \), \( 2024_6 \mod 8 \), and \( 2024_7 \mod 8 \) all appear exactly 253 times each, so we have \( 253 \times 3 = 759 \) different values of \( K \). | ||
+ | |||
+ | However, we must not include \( 2024_3 \), as the bases \( b \) range from \( 5 \le b \le 2024 \), therefore we have \( 759-1=758 \) cases. | ||
+ | |||
+ | Our answer is \( 7+5+8= \) <math>\boxed{\text{(D) }20}</math>. | ||
+ | |||
+ | ~Pinotation (I did not do the solution above this remark) | ||
+ | |||
+ | ==Solution 5 (Factoring)== | ||
+ | |||
+ | Start similar to other solutions. | ||
+ | |||
+ | <cmath>b^3+b+2 \equiv 0\pmod 8</cmath> | ||
+ | |||
+ | Except now we notice the following: | ||
+ | |||
+ | \begin{align*} | ||
+ | b^3+8+b+2 \equiv 8\pmod 8 \equiv 0\pmod 8\\ | ||
+ | (b+2)(b^2-2b+4) + b+2 \equiv 0\pmod 8\\ | ||
+ | (b+2)(b^2-b+5) \equiv 0\pmod 8\\ | ||
+ | \end{align*} | ||
+ | |||
+ | Notice that <math>b+2</math> and <math>b^2-b+5</math> have opposite parity, and when multiplied, is divisible by <math>8</math>. | ||
+ | Thus, either <math>b+2</math> or <math>b^2-b+5</math> is divisible by <math>8</math>. | ||
+ | |||
+ | <math>b+2</math> is obvious, where <math>b+2 | 8</math> when <math>b \equiv 6\pmod 8</math> | ||
+ | |||
+ | When testing for <math>b^2-b+5 | 8</math>, we find <math>b \equiv 3, 7\pmod 8</math> | ||
+ | |||
+ | Proceed similar to the other solutions, <math>\lfloor\dfrac{3}{8} \cdot 2024\rfloor-1=759-1=758</math>, where <math>7+5+8=\boxed{\text{(D) }20}</math> | ||
+ | |||
+ | ~ NSAoPS | ||
+ | |||
+ | ==Video Solution by [https://artofproblemsolving.com/wiki/index.php/User:grogg007 grogg007]== | ||
https://youtu.be/xDye0tT4oPc | https://youtu.be/xDye0tT4oPc | ||
Line 110: | Line 148: | ||
https://youtu.be/snp3Yo8rU-M?si=GHqpGqQs6Q0xM57j | https://youtu.be/snp3Yo8rU-M?si=GHqpGqQs6Q0xM57j | ||
− | == | + | == Video solution by TheNeuralMathAcademy == |
− | + | https://www.youtube.com/watch?v=4b_YLnyegtw&t=3726s | |
− | {{ | + | |
+ | ==See Also== | ||
+ | {{AMC10 box|year=2024|ab=A|before=[[2023 AMC 10B Problems]]|after=[[2024 AMC 10B Problems]]}} | ||
+ | * [[AMC 10]] | ||
+ | * [[AMC 10 Problems and Solutions]] | ||
+ | * [[Mathematics competitions]] | ||
+ | * [[Mathematics competition resources]] | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 13:47, 28 September 2025
- The following problem is from both the 2024 AMC 10A #18 and 2024 AMC 12A #11, so both problems redirect to this page.
Contents
Problem
There are exactly positive integers
with
such that the base-
integer
is divisible by
(where
is in base ten). What is the sum of the digits of
?
Solution 1
, if
is even then
. If
is odd then
so
. Now
so
but one of the answers we got from that,
, is too small, so
.
~OronSH ~mathkiddus ~andliu766 ~megaboy6679 ~trevian1(minor edit for clarity)
Solution 2
\begin{align*} 2024_b\equiv0\pmod{16} \\ 2b^3+2b+4\equiv0\pmod{16} \\ b^3+b+2\equiv0\pmod8 \\ \end{align*}
Clearly, is either even or odd. If
is even, let
.
\begin{align*} (2a)^3+2a+2\equiv0\pmod8 \\ 8a^3+2a+2\equiv0\pmod8 \\ 0+2a+2\equiv0\pmod8 \\ a+1\equiv0\pmod4 \\ a\equiv3\pmod4 \\ \end{align*}
Thus, one solution is for some integer
, or
.
What if is odd? Then let
:
\begin{align*} (2a+1)^3+2a+1+2\equiv0\pmod8 \\ 8a^3+12a^2+6a+1+2a+1+2\equiv0\pmod8 \\ 8a^3+12a^2+8a+4\equiv0\pmod8 \\ 4a^2+4\equiv0\pmod8 \\ a^2\equiv1\pmod2 \\ \end{align*}
This simply states that is odd. Thus, the other solution is
for some integer
, or
.
We now simply must count the number of integers between and
, inclusive, that are
mod
or
mod
. Note that the former case comprises even numbers only while the latter is only odd; thus, there is no overlap and we can safely count the number of each and add them.
In the former case, we have the numbers ; this list is equivalent to
, which comprises
numbers. In the latter case, we have the numbers
, which comprises
numbers. There are
numbers in total, so our answer is
.
~Technodoggo
Solution 3
Note that is to be divisible by
, which means that
is divisible by
.
If , then
is not divisible by
.
If , then
is not divisible by
.
If , then
is not divisible by
.
If , then
is divisible by
.
If , then
is not divisible by
.
If , then
is not divisible by
.
If , then
is divisible by
.
If , then
is divisible by
.
Therefore, for every values of
,
of them will make
divisible by
. Therefore, since
is divisible by
,
values of
, but this includes
, which does not satisfy the given inequality. Therefore, the answer is
~Tacos_are_yummy_1
More detail by ~luckuso
Solution 4
\begin{align*} 2024_{(b+8)}-2024_b\equiv0\ (mod\ 16)\\ 2024_{(b+8)}\ \ \equiv2024_b\ \ (mod\ 16)\\ 2024_0\equiv4\ (mod\ 16)\\ 2024_1\equiv8\ (mod\ 16)\\ 2024_2\equiv6\ (mod\ 16)\\ 2024_3\equiv0(mod\ 16)\\ 2024_4\equiv12(mod\ 16)\\ 2024_5\equiv8(mod\ 16)\\ 2024_6\equiv0(mod\ 16)\\ 2024_7\equiv0(mod\ 16)\\ \end{align*}
We need
take away one because
is out of range, so
Solution 4.1: Alternate Ending
One can arrange 2024 into different "blocks" consisting of 8 numbers each, particularly \( \{0,1,2,3,4,5,6,7\} \), \( \{8,9,10,11,12,13,14,15\} \) ...
These just represent different \( \mod(8) \) class residues. So, you can just divide 2024 by 8 blocks giving us 253 total blocks with 0 extra semi-blocks.
We see that \( 2024_3 \mod 8 \), \( 2024_6 \mod 8 \), and \( 2024_7 \mod 8 \) all appear exactly 253 times each, so we have \( 253 \times 3 = 759 \) different values of \( K \).
However, we must not include \( 2024_3 \), as the bases \( b \) range from \( 5 \le b \le 2024 \), therefore we have \( 759-1=758 \) cases.
Our answer is \( 7+5+8= \) .
~Pinotation (I did not do the solution above this remark)
Solution 5 (Factoring)
Start similar to other solutions.
Except now we notice the following:
\begin{align*} b^3+8+b+2 \equiv 8\pmod 8 \equiv 0\pmod 8\\ (b+2)(b^2-2b+4) + b+2 \equiv 0\pmod 8\\ (b+2)(b^2-b+5) \equiv 0\pmod 8\\ \end{align*}
Notice that and
have opposite parity, and when multiplied, is divisible by
.
Thus, either
or
is divisible by
.
is obvious, where
when
When testing for , we find
Proceed similar to the other solutions, , where
~ NSAoPS
Video Solution by grogg007
Video Solution by Power Solve
https://www.youtube.com/watch?v=qtFvaD9TEaA
Video Solution by Pi Academy
https://youtu.be/fW7OGWee31c?si=oq7toGPh2QaksLHE
Video Solution by SpreadTheMathLove
https://youtu.be/snp3Yo8rU-M?si=GHqpGqQs6Q0xM57j
Video solution by TheNeuralMathAcademy
https://www.youtube.com/watch?v=4b_YLnyegtw&t=3726s
See Also
2024 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by 2023 AMC 10B Problems |
Followed by 2024 AMC 10B Problems | |
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.