Difference between revisions of "2017 AMC 12B Problems/Problem 19"
(→Solution) |
Soyamyboya (talk | contribs) (→Solution) |
||
Line 14: | Line 14: | ||
<cmath>\frac{44\cdot 45}{2} = 22\cdot 45 \equiv 0\bmod\ 9.</cmath> | <cmath>\frac{44\cdot 45}{2} = 22\cdot 45 \equiv 0\bmod\ 9.</cmath> | ||
− | + | Let <math>x</math> be the remainder when this number is divided by <math>45</math>. We know that <math>x\equiv 0 \pmod {9}</math> and <math>x\equiv 4 \pmod {5}</math>, so by the Chinese remainder theorem, since <math>9(-1)\equiv 1 \pmod{5}</math>, <math>x\equiv 5(0)+9(-1)(4) \pmod {5\cdot 9}</math>, or <math>x\equiv -36 \equiv 9 \pmod {45}</math>. So the answer is <math>\boxed {\bold {(C)}}</math>. | |
==See Also== | ==See Also== |
Revision as of 17:39, 20 January 2018
Problem
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
We will consider this number and . By looking at the last digit, it is obvious that the number is . To calculate the number , note that
so it is equivalent to
Let be the remainder when this number is divided by . We know that and , so by the Chinese remainder theorem, since , , or . So the answer is .
See Also
2017 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 18 |
Followed by Problem 20 |
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 |
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.