Difference between revisions of "2018 AMC 8 Problems/Problem 7"
Swayamshah (talk | contribs) (→Solution) |
m (→Solution) |
||
| (12 intermediate revisions by 8 users not shown) | |||
| Line 1: | Line 1: | ||
| − | ==Problem | + | ==Problem== |
The <math>5</math>-digit number <math>\underline{2}</math> <math>\underline{0}</math> <math>\underline{1}</math> <math>\underline{8}</math> <math>\underline{U}</math> is divisible by <math>9</math>. What is the remainder when this number is divided by <math>8</math>? | The <math>5</math>-digit number <math>\underline{2}</math> <math>\underline{0}</math> <math>\underline{1}</math> <math>\underline{8}</math> <math>\underline{U}</math> is divisible by <math>9</math>. What is the remainder when this number is divided by <math>8</math>? | ||
| Line 6: | Line 6: | ||
==Solution== | ==Solution== | ||
| − | We use the property that the digits of a number must sum to a multiple of <math>9</math> if it are divisible by <math>9</math>. This means <math>2+0+1+8+U</math> must be divisible by <math>9</math>. The only possible value for <math>U</math> then must be <math>7</math>. Since we are looking for the remainder when divided by <math>8</math>, we can ignore the thousands. The remainder when <math>187</math> is divided by <math>8</math> is <math>\boxed{\textbf{(B) }3}</math> | + | We use the property that the digits of a number must sum to a multiple of <math>9</math> if it are divisible by <math>9</math>. This means <math>2+0+1+8+U</math> must be divisible by <math>9</math>. The only possible value for <math>U</math> then must be <math>7</math>. Since we are looking for the remainder when divided by <math>8</math>, we can ignore the thousands. The remainder when <math>187</math> is divided by <math>8</math> is <math>\boxed{\textbf{(B) }3}</math>. |
| + | |||
| + | If you got stuck on this problem, refer to AOPS Number Theory. You're smart. | ||
| + | |||
| + | -InterstellerApex, Nivaar | ||
| + | |||
| + | == Video Solution (CRITICAL THINKING!!!)== | ||
| + | https://youtu.be/uTBCTiIJbOY | ||
| + | |||
| + | ~Education, the Study of Everything | ||
| + | |||
| + | ==Video Solution by OmegaLearn== | ||
| + | https://youtu.be/6xNkyDgIhEE?t=2341 | ||
| + | |||
| + | ==Video Solution== | ||
| + | |||
| + | https://youtu.be/doHZiAT36BY | ||
| + | |||
| + | ~savannahsolver | ||
==See Also== | ==See Also== | ||
Latest revision as of 16:17, 5 June 2024
Contents
Problem
The 
-digit number 
is divisible by 
. What is the remainder when this number is divided by 
?
Solution
We use the property that the digits of a number must sum to a multiple of if it are divisible by . This means 
must be divisible by . The only possible value for 
then must be 
. Since we are looking for the remainder when divided by , we can ignore the thousands. The remainder when 
is divided by is 
.
If you got stuck on this problem, refer to AOPS Number Theory. You're smart.
-InterstellerApex, Nivaar
Video Solution (CRITICAL THINKING!!!)
~Education, the Study of Everything
Video Solution by OmegaLearn
https://youtu.be/6xNkyDgIhEE?t=2341
Video Solution
~savannahsolver
See Also
| 2018 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 6 |
Followed by Problem 8 | |
| 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 AJHSME/AMC 8 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
