Difference between revisions of "2024 AMC 10A Problems/Problem 18"
(→Solution 3) |
(→Solution 3) |
||
(12 intermediate revisions by 9 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 <math>3</math> is too small so <math>759 - 1 = 758\implies\boxed{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> 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 <math>3</math> is too small so <math>759 - 1 = 758\implies\boxed{\textbf{(D) }20}</math>. |
− | ~OronSH ~mathkiddus ~andliu766 | + | |
+ | ~OronSH ~[[User:Mathkiddus|mathkiddus]] ~andliu766 ~megaboy6679 | ||
==Solution 2== | ==Solution 2== | ||
Line 44: | Line 45: | ||
We now simply must count the number of integers between <math>5</math> and <math>2024</math>, inclusive, that are <math>6</math> mod <math>8</math> or <math>3</math> mod <math>4</math>. 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. | We now simply must count the number of integers between <math>5</math> and <math>2024</math>, inclusive, that are <math>6</math> mod <math>8</math> or <math>3</math> mod <math>4</math>. 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 <math>6,14,22,30,\dots,2022</math>; this list is equivalent to <math>8,16,24,32,\dots,2024\cong1, | + | In the former case, we have the numbers <math>6,14,22,30,\dots,2022</math>; this list is equivalent to <math>8,16,24,32,\dots,2024\cong1,2,3,4,\dots,253</math>, which comprises <math>253</math> numbers. In the latter case, we have the numbers <math>7,11,15,19,\dots,2023\cong4,8,12,16,\dots,2020\cong1,2,3,4,\dots,505</math>, which comprises <math>505</math> numbers. There are <math>758</math> numbers in total, so our answer is <math>7+5+8=\boxed{\textbf{(D) 20}}</math>. |
~Technodoggo | ~Technodoggo | ||
==Solution 3== | ==Solution 3== | ||
+ | Note that <math>2024_b=2b^3+2b+4</math> is to be divisible by <math>16</math>, which means that <math>b^3+b+2</math> is divisible by <math>8</math>. | ||
+ | |||
+ | If <math>b=0</math>, then <math>b^3+b+2 \equiv (0)^3 + (0) + 2 \equiv 2</math> is not divisible by <math>8</math>. | ||
+ | |||
+ | If <math>b=1</math>, then <math>b^3+b+2 \equiv (1)^3 + (1) + 2 \equiv 4</math> is not divisible by <math>8</math>. | ||
+ | |||
+ | If <math>b=2</math>, then <math>b^3+b+2 \equiv (2)^3 + (2) + 2 \equiv 4</math> is not divisible by <math>8</math>. | ||
+ | |||
+ | If <math>b=3</math>, then <math>b^3+b+2 \equiv (3)^3 + (3) + 2 \equiv (8+1)\cdot3 + (3) + 2 \equiv 8 </math> is divisible by <math>8</math>. | ||
+ | |||
+ | If <math>b=4</math>, then <math>b^3+b+2 \equiv (4)^3 + (4) + 2 \equiv 0 + 4 + 2 \equiv 6 </math> is not divisible by <math>8</math>. | ||
+ | |||
+ | If <math>b=5</math>, then <math>b^3+b+2 \equiv (-3)^3 + (-3) + 2 \equiv (8+1)\cdot 3 + (-3) + 2 \equiv 2 </math> is not divisible by <math>8</math>. | ||
+ | |||
+ | If <math>b=6</math>, then <math>b^3+b+2 \equiv (-2)^3 + (-2) + 2 \equiv -8 + (-2) + 2 \equiv 0 </math> is divisible by <math>8</math>. | ||
+ | |||
+ | If <math>b=7</math>, then <math>b^3+b+2 \equiv (-1)^3 + (-1) + 2 \equiv -1 + (-1) + 2 \equiv 0 </math> is divisible by <math>8</math>. | ||
+ | |||
+ | Therefore, for every <math>8</math> values of <math>b</math>, <math>3</math> of them will make <math>b^3+b+2</math> divisible by <math>8</math>. Therefore, since <math>2024</math> is divisible by <math>8</math>, <math>\dfrac{3}{8}\cdot2024=759</math> values of <math>b</math>, but this includes <math>b=3</math>, which does not satisfy the given inequality. Therefore, the answer is <cmath>759-1=758\rightarrow7+5+8=\boxed{\text{(D) }20}</cmath> ~Tacos_are_yummy_1 | ||
+ | |||
+ | More detail by ~[https://artofproblemsolving.com/wiki/index.php/User:Cyantist luckuso] | ||
+ | |||
+ | ==Solution 4== | ||
<math>2024_b=2\ast\ b^3+2\ast\ b+4\ \\ | <math>2024_b=2\ast\ b^3+2\ast\ b+4\ \\ | ||
Line 55: | Line 79: | ||
\begin{align*} | \begin{align*} | ||
− | 2024_(b+8)-2024_b\equiv0\ (mod\ 16)\\ | + | 2024_{(b+8)}-2024_b\equiv0\ (mod\ 16)\\ |
− | 2024_(b+8)\ \ \equiv2024_b\ \ (mod\ 16)\\ | + | 2024_{(b+8)}\ \ \equiv2024_b\ \ (mod\ 16)\\ |
2024_0\equiv4\ (mod\ 16)\\ | 2024_0\equiv4\ (mod\ 16)\\ | ||
2024_1\equiv8\ (mod\ 16)\\ | 2024_1\equiv8\ (mod\ 16)\\ | ||
Line 67: | Line 91: | ||
\end{align*} | \end{align*} | ||
− | + | We need | |
− | <math>b\ \equiv3\ (mod\ 8)\ \ or\ b\ \equiv6\ (mod\ 8)\ \ or\ b\ \equiv7\ (mod\ 8) | + | <math>b\ \equiv3\ (mod\ 8)\ \ or\ b\ \equiv6\ (mod\ 8)\ \ or\ b\ \equiv7\ (mod\ 8) \\ |
− | + | \lfloor(2024-3)/8\rfloor+\lfloor(2024-6)/8\rfloor+\lfloor(2024-7)/8\rfloor+3=759</math> | |
− | take away one because 3 is out of range so 758 | + | take away one because <math>b=3</math> is out of range, so <math>758\Rightarrow7+8+5=\boxed{\text{(D) }20}</math> |
− | + | ||
+ | |||
+ | == 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://www.youtube.com/watch?v=6SQ74nt3ynw | ||
==See also== | ==See also== |
Latest revision as of 14:37, 17 November 2024
- 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 even then . If odd then so . Now so but is too small so .
~OronSH ~mathkiddus ~andliu766 ~megaboy6679
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
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://www.youtube.com/watch?v=6SQ74nt3ynw
See also
2024 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 17 |
Followed by Problem 19 | |
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 |
2024 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 10 |
Followed by Problem 12 |
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.