Difference between revisions of "2020 AMC 10A Problems/Problem 22"
(→Solution 1 (Casework)) |
(→Solution 1 (Casework)) |
||
Line 12: | Line 12: | ||
Let <math>a = \left\lfloor \frac{998}n \right\rfloor</math>. | Let <math>a = \left\lfloor \frac{998}n \right\rfloor</math>. | ||
− | + | Notice that for every integer <math>n \neq 1</math>, | |
<math>\bullet</math> if <math>\frac{998}n</math> is an integer, then the three terms in the expression above must be <math>(a, a, a)</math>, | <math>\bullet</math> if <math>\frac{998}n</math> is an integer, then the three terms in the expression above must be <math>(a, a, a)</math>, | ||
Line 18: | Line 18: | ||
<math>\bullet</math> if <math>\frac{999}n</math> is an integer, then the three terms in the expression above must be <math>(a, a + 1, a + 1)</math>, and | <math>\bullet</math> if <math>\frac{999}n</math> is an integer, then the three terms in the expression above must be <math>(a, a + 1, a + 1)</math>, and | ||
− | <math>\bullet</math> if <math>\frac{1000}n</math> is an integer, then the three terms in the expression above must be <math>(a, a, a + 1)</math>. | + | <math>\bullet</math> if <math>\frac{1000}n</math> is an integer, then the three terms in the expression above must be <math>(a, a, a + 1)</math>. |
This is due to the fact that <math>998</math>, <math>999</math>, and <math>1000</math> share no common factors other than 1. | This is due to the fact that <math>998</math>, <math>999</math>, and <math>1000</math> share no common factors other than 1. | ||
Line 28: | Line 28: | ||
− | + | Now, we test the three cases mentioned above. | |
− | |||
− | <b>Case 1:</b> <math>n</math> divides <math>999</math> | + | <b>Case 1:</b> <math>n</math> divides <math>998</math> |
+ | |||
+ | The first case does not work, as the sum becomes <math>3a</math>, which is divisible by 3. | ||
+ | So, there are only two viable cases: | ||
+ | |||
+ | |||
+ | <b>Case 2:</b> <math>n</math> divides <math>999</math> | ||
Because <math>n</math> divides <math>999</math>, the number of possibilities for <math>n</math> is the same as the number of factors of <math>999</math>, excluding <math>1</math>. | Because <math>n</math> divides <math>999</math>, the number of possibilities for <math>n</math> is the same as the number of factors of <math>999</math>, excluding <math>1</math>. | ||
Line 44: | Line 49: | ||
<math>8 - 1 = 7</math> | <math>8 - 1 = 7</math> | ||
− | We now do the same for the | + | We now do the same for the third case. |
− | <b>Case | + | <b>Case 3:</b> <math>n</math> divides <math>1000</math> |
<math>1000</math> = <math>5^3 \cdot 2^3</math> | <math>1000</math> = <math>5^3 \cdot 2^3</math> |
Revision as of 20:19, 1 February 2020
Problem
For how many positive integers isnot divisible by ? (Recall that is the greatest integer less than or equal to .)
Solution 1 (Casework)
Let .
Notice that for every integer ,
if is an integer, then the three terms in the expression above must be ,
if is an integer, then the three terms in the expression above must be , and
if is an integer, then the three terms in the expression above must be .
This is due to the fact that , , and share no common factors other than 1. Note that doesn't work; to prove this, all we just have to is substitute for in the expression, to get
This gives us which is divisible by 3.
Now, we test the three cases mentioned above.
Case 1: divides
The first case does not work, as the sum becomes , which is divisible by 3. So, there are only two viable cases:
Case 2: divides
Because divides , the number of possibilities for is the same as the number of factors of , excluding .
=
So, the total number of factors of is .
However, we have to subtract , because the case doesn't work, as mentioned previously.
We now do the same for the third case.
Case 3: divides
=
So, the total number of factors of is .
Again, we have to subtract , for the reason mentioned above in Case 1.
Now that we have counted all of the cases, we add them.
, so the answer is .
~dragonchomper
Video Solution
~IceMatrix
See Also
2020 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 21 |
Followed by Problem 23 | |
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.