Difference between revisions of "2020 AMC 10A Problems/Problem 22"
(→Solution 1 (Casework)) |
(→Solution 1 (Casework)) |
||
Line 7: | Line 7: | ||
== Solution 1 (Casework) == | == Solution 1 (Casework) == | ||
− | Let <math>a = \left\lfloor \frac{999}n \right\rfloor</math>. Notice that for every integer <math>n \neq 1</math> if <math>\frac{999}n</math> is an integer, then the three terms in the expression must be <math>(a, a + 1, a + 1)</math>, and if <math>\frac{1000}n</math> is an integer, then the three terms in the expression must be <math>(a, a, a + 1)</math>. This is due to the fact that <math>999</math> and <math>1000</math> share no factors other than 1. | + | Let <math>a = \left\lfloor \frac{999}n \right\rfloor</math>. Notice that for every integer <math>n \neq 1</math>, if <math>\frac{999}n</math> is an integer, then the three terms in the expression must be <math>(a, a + 1, a + 1)</math>, and if <math>\frac{1000}n</math> is an integer, then the three terms in the expression must be <math>(a, a, a + 1)</math>. This is due to the fact that <math>999</math> and <math>1000</math> share no factors other than 1. |
Note that <math>n = 1</math> doesn't work because <math>\frac{999}n + \frac{999}n + \frac{999}n = 2997</math> which is divisible by 3. | Note that <math>n = 1</math> doesn't work because <math>\frac{999}n + \frac{999}n + \frac{999}n = 2997</math> which is divisible by 3. | ||
So, there are two cases: | So, there are two cases: |
Revision as of 19:47, 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 must be , and if is an integer, then the three terms in the expression must be . This is due to the fact that and share no factors other than 1. Note that doesn't work because which is divisible by 3. So, there are two cases:
Case 1: 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.
We now do the same for the second case.
Case 2: 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.