Difference between revisions of "2018 AMC 12B Problems/Problem 15"
(→Solution 4) |
Pi is 3.14 (talk | contribs) (→Solution 4 (easy)) |
||
(7 intermediate revisions by 6 users not shown) | |||
Line 4: | Line 4: | ||
<math>\textbf{(A) } 96 \qquad \textbf{(B) } 97 \qquad \textbf{(C) } 98 \qquad \textbf{(D) } 102 \qquad \textbf{(E) } 120 </math> | <math>\textbf{(A) } 96 \qquad \textbf{(B) } 97 \qquad \textbf{(C) } 98 \qquad \textbf{(D) } 102 \qquad \textbf{(E) } 120 </math> | ||
− | == Solution 1 | + | == Solution 1== |
Analyze that the three-digit integers divisible by <math>3</math> start from <math>102</math>. In the <math>200</math>'s, it starts from <math>201</math>. In the <math>300</math>'s, it starts from <math>300</math>. We see that the units digits is <math>0, 1, </math> and <math>2.</math> | Analyze that the three-digit integers divisible by <math>3</math> start from <math>102</math>. In the <math>200</math>'s, it starts from <math>201</math>. In the <math>300</math>'s, it starts from <math>300</math>. We see that the units digits is <math>0, 1, </math> and <math>2.</math> | ||
Line 21: | Line 21: | ||
Consider the number of <math>2</math>-digit numbers that do not contain the digit <math>3</math>, which is <math>90-18=72</math>. For any of these <math>2</math>-digit numbers, we can append <math>1,5,7,</math> or <math>9</math> to reach a desirable <math>3</math>-digit number. However, <math>1 \equiv 7 \equiv 1</math> <math>(mod</math> <math>3)</math>, and thus we need to count any <math>2</math>-digit number <math>\equiv 2</math> <math>(mod</math> <math>3)</math> twice. There are <math>(98-11)/3+1=30</math> total such numbers that have remainder <math>2</math>, but <math>6</math> of them <math>(23,32,35,38,53,83)</math> contain <math>3</math>, so the number we want is <math>30-6=24</math>. Therefore, the final answer is <math>72+24= \boxed{96}</math>. | Consider the number of <math>2</math>-digit numbers that do not contain the digit <math>3</math>, which is <math>90-18=72</math>. For any of these <math>2</math>-digit numbers, we can append <math>1,5,7,</math> or <math>9</math> to reach a desirable <math>3</math>-digit number. However, <math>1 \equiv 7 \equiv 1</math> <math>(mod</math> <math>3)</math>, and thus we need to count any <math>2</math>-digit number <math>\equiv 2</math> <math>(mod</math> <math>3)</math> twice. There are <math>(98-11)/3+1=30</math> total such numbers that have remainder <math>2</math>, but <math>6</math> of them <math>(23,32,35,38,53,83)</math> contain <math>3</math>, so the number we want is <math>30-6=24</math>. Therefore, the final answer is <math>72+24= \boxed{96}</math>. | ||
− | ==Solution 4== | + | ==Solution 4 (easy)== |
− | + | We need to take care of all restrictions. Ranging from <math>101</math> to <math>999</math>, there are <math>450</math> odd 3-digit numbers. Exactly <math>\frac{1}{3}</math> of these numbers are divisible by 3, which is <math>450\times\frac{1}{3}=150</math>. Of these 150 numbers, <math>\frac{4}{5}</math> <math>\textbf{do not}</math> have 3 in their ones (units) digit, <math>\frac{9}{10}</math> <math>\textbf{do not}</math> have 3 in their tens digit, and <math>\frac{8}{9}</math> <math>\textbf{do not}</math> have 3 in their hundreds digit. Thus, the total number of 3 digit integers are <math>900\times\frac{1}{2}\times\frac{1}{3}\times\frac{4}{5}\times\frac{9}{10}\times\frac{8}{9}=96</math>, or <math>\boxed{\text{A}}</math> | |
− | + | ~mathpro12345 | |
− | + | == Video Solution == | |
+ | https://youtu.be/mgEZOXgIZXs?t=448 | ||
− | + | ~ pi_is_3.14 | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
==See Also== | ==See Also== |
Latest revision as of 23:21, 17 January 2021
Contents
Problem
How many odd positive 3-digit integers are divisible by 3 but do not contain the digit 3?
Solution 1
Analyze that the three-digit integers divisible by start from . In the 's, it starts from . In the 's, it starts from . We see that the units digits is and
Write out the 1- and 2-digit multiples of starting from and Count up the ones that meet the conditions. Then, add up and multiply by , since there are three sets of three from to Then, subtract the amount that started from , since the 's ll contain the digit .
We get:
This gives us:
Solution 2
There are choices for the last digit (), and choices for the first digit (exclude ). We know what the second digit mod is, so there are choices for it (pick from one of the sets ). The answer is (Plasma_Vortex)
Solution 3
Consider the number of -digit numbers that do not contain the digit , which is . For any of these -digit numbers, we can append or to reach a desirable -digit number. However, , and thus we need to count any -digit number twice. There are total such numbers that have remainder , but of them contain , so the number we want is . Therefore, the final answer is .
Solution 4 (easy)
We need to take care of all restrictions. Ranging from to , there are odd 3-digit numbers. Exactly of these numbers are divisible by 3, which is . Of these 150 numbers, have 3 in their ones (units) digit, have 3 in their tens digit, and have 3 in their hundreds digit. Thus, the total number of 3 digit integers are , or
~mathpro12345
Video Solution
https://youtu.be/mgEZOXgIZXs?t=448
~ pi_is_3.14
See Also
2018 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 14 |
Followed by Problem 16 |
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.