Difference between revisions of "2017 AMC 10B Problems/Problem 23"
Arcticturn (talk | contribs) (→Solution 2) |
Arcticturn (talk | contribs) (→Solution 3) |
||
Line 22: | Line 22: | ||
==Solution 3== | ==Solution 3== | ||
+ | We know that <math>45</math> = <math>5</math> x <math>9</math>, so we can apply our restrictions to that. We know that the units digit must be <math>5</math> or <math>0</math>, and the digits must add up to a multiple of <math>9</math>. <math>1+2+3+4... + 44</math> = <math>44*45/2</math>. We can quickly see this is a multiple of <math>9</math> because <math>44/2 * 45</math> = <math>22*45</math>. We know this is not a multiple of <math>5</math> because the units digit doesn't end in <math>5</math> or <math>10</math>. We can just subtract by 9 until we get a number whose units digit is 5 or 0! | ||
+ | |||
+ | We have <math>123...44</math> so we can subtract by <math>9</math> to get <math>123...35</math> and we know that this is divisible by 5. So our answer is <math>\boxed{\textbf{(C) } 9}</math> | ||
+ | |||
+ | ~Arcticturn | ||
==See Also== | ==See Also== | ||
{{AMC10 box|year=2017|ab=B|num-b=22|num-a=24}} | {{AMC10 box|year=2017|ab=B|num-b=22|num-a=24}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 12:44, 29 June 2021
Contents
[hide]Problem 23
Let be the -digit number that is formed by writing the integers from to in order, one after the other. What is the remainder when is divided by ?
Solution 1
We only need to find the remainders of N when divided by 5 and 9 to determine the answer. By inspection, . The remainder when is divided by is , but since , we can also write this as , which has a remainder of 0 mod 9. Solving these modular congruence using CRT(Chinese Remainder Theorem) we get the remainder to be . Therefore, the answer is .
Alternative Ending to Solution 1
Once we find our 2 modular congruences, we can narrow our options down to and because the remainder when is divided by should be a multiple of 9 by our modular congruence that states has a remainder of when divided by . Also, our other modular congruence states that the remainder when divided by should have a remainder of when divided by . Out of options and , only satisfies that the remainder when is divided by .
Solution 2
Realize that for all positive integers .
Apply this on the expanded form of :
Solution 3
We know that = x , so we can apply our restrictions to that. We know that the units digit must be or , and the digits must add up to a multiple of . = . We can quickly see this is a multiple of because = . We know this is not a multiple of because the units digit doesn't end in or . We can just subtract by 9 until we get a number whose units digit is 5 or 0!
We have so we can subtract by to get and we know that this is divisible by 5. So our answer is
~Arcticturn
See Also
2017 AMC 10B (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 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.