Difference between revisions of "2020 AMC 10A Problems/Problem 22"
(→Solution 3) |
(→Solution 3) |
||
Line 100: | Line 100: | ||
Now, quickly observe that if <math>n>2</math> divides <math>998</math>, then <math>\left\lfloor {\frac{999}{n}} \right\rfloor</math> and <math>\left\lfloor {\frac{1000}{n}} \right\rfloor</math> will also round down to <math>\frac{998}{n}</math>, giving us a sum of <math>3 \cdot \frac{998}{n}</math>, which does not work for the question. However, if <math>n>2</math> divides <math>999</math>, we see that <math>\left\lfloor {\frac{998}{n}} \right\rfloor = \frac{999}{n}-1</math> and <math>\left\lfloor {\frac{1000}{n}} \right\rfloor=\left\lfloor {\frac{999}{n}} \right\rfloor</math>. This gives us a sum of <math>3 \cdot \left\lfloor {\frac{999}{n}} \right\rfloor - 1</math>, which is clearly not divisible by <math>3</math>. Using the same logic, we can deduce that <math>(n>2)|1000</math> too works (for our problem). Thus, we need the factors of <math>999</math> and <math>1000</math> and we don't have to eliminate any because the <math>\text{gcf} (999,1000)=1</math>. But we have to be careful! See that when <math>n|998,999,1000</math>, then our problem doesn't get fulfilled. The only <math>n</math> that satisfies that is <math>n=1</math>. So, we have: | Now, quickly observe that if <math>n>2</math> divides <math>998</math>, then <math>\left\lfloor {\frac{999}{n}} \right\rfloor</math> and <math>\left\lfloor {\frac{1000}{n}} \right\rfloor</math> will also round down to <math>\frac{998}{n}</math>, giving us a sum of <math>3 \cdot \frac{998}{n}</math>, which does not work for the question. However, if <math>n>2</math> divides <math>999</math>, we see that <math>\left\lfloor {\frac{998}{n}} \right\rfloor = \frac{999}{n}-1</math> and <math>\left\lfloor {\frac{1000}{n}} \right\rfloor=\left\lfloor {\frac{999}{n}} \right\rfloor</math>. This gives us a sum of <math>3 \cdot \left\lfloor {\frac{999}{n}} \right\rfloor - 1</math>, which is clearly not divisible by <math>3</math>. Using the same logic, we can deduce that <math>(n>2)|1000</math> too works (for our problem). Thus, we need the factors of <math>999</math> and <math>1000</math> and we don't have to eliminate any because the <math>\text{gcf} (999,1000)=1</math>. But we have to be careful! See that when <math>n|998,999,1000</math>, then our problem doesn't get fulfilled. The only <math>n</math> that satisfies that is <math>n=1</math>. So, we have: | ||
<math>999=3^3\cdot 37 \implies (3+1)(1+1)-1 \text{*factors*} \implies 7</math>; | <math>999=3^3\cdot 37 \implies (3+1)(1+1)-1 \text{*factors*} \implies 7</math>; | ||
− | <math>1000=2^3\cdot 5^3 \implies (3+1)(3+1)-1 \text{*factors*} \implies 15</math> | + | <math>1000=2^3\cdot 5^3 \implies (3+1)(3+1)-1 \text{*factors*} \implies 15</math>. |
Adding them up gives a total of <math>7+15=\boxed{\textbf{(A)}22}</math> workable <math>n</math>'s. | Adding them up gives a total of <math>7+15=\boxed{\textbf{(A)}22}</math> workable <math>n</math>'s. | ||
Revision as of 22:26, 27 February 2020
Contents
[hide]Problem
For how many positive integers isnot divisible by ? (Recall that is the greatest integer less than or equal to .)
Solution 1 (Casework)
Expression:
Solution:
Let
Since , for any integer , the difference between the largest and smallest terms before the function is applied is less than or equal to , and thus the terms must have a range of or less after the function is applied.
This means that for every integer ,
if is an integer and , then the three terms in the expression above must be ,
if is an integer because , then will be an integer and will be greater than ; thus the three terms in the expression must be ,
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 none of are integral, then the three terms in the expression above must be .
The last statement is true because in order for the terms to be different, there must be some integer in the interval or the interval . However, this means that multiplying the integer by should produce a new integer between and or and , exclusive, but because no such integers exist, the terms cannot be different, and thus, must be equal.
Note that does not work; to prove this, we just have to substitute for in the expression.
This gives us
which is divisible by 3.
Now, we test the five cases listed above (where )
Case 1: divides and
As mentioned above, the three terms in the expression are , so the sum is , which is divisible by . Therefore, the first case does not work (0 cases).
Case 2: divides and
As mentioned above, in this case the terms must be , which means the sum is , so the expression is not divisible by . Therefore, this is 1 case that works.
Case 3: divides
Because divides , the number of possibilities for is the same as the number of factors of .
= . So, the total number of factors of is .
However, we have to subtract , because the case does not work, as mentioned previously. This leaves 7 cases.
Case 4: divides
Because divides , the number of possibilities for is the same as the number of factors of .
= . So, the total number of factors of is .
Again, we have to subtract , so this leaves cases. We have also overcounted the factor , as it has been counted as a factor of and as a separate case (Case 2). , so there are actually 14 valid cases.
Case 5: divides none of
Similar to Case 1, the value of the terms of the expression are . The sum is , which is divisible by 3, so this case does not work (0 cases).
Now that we have counted all of the cases, we add them.
, so the answer is .
~dragonchomper, additional edits by emerald_block
Solution 2 (Solution 1 but simpler)
Note that this solution does not count a majority of cases that are important to consider in similar problems, though they are not needed for this problem, and therefore it may not work with other, similar problems.
Notice that you only need to count the number of factors of 1000 and 999, excluding 1.
1000 has 16 factors, and 999 has 8.
Adding them gives you 24, but you need to subtract 2 since 1 does not work.
Therefore, the answer is 24 - 2 = .
-happykeeper, additional edits by dragonchomper
Solution 3
NOTE: For this problem, whenever I say , I will be referring to all the factors of the number except for .
Now, quickly observe that if divides , then and will also round down to , giving us a sum of , which does not work for the question. However, if divides , we see that and . This gives us a sum of , which is clearly not divisible by . Using the same logic, we can deduce that too works (for our problem). Thus, we need the factors of and and we don't have to eliminate any because the . But we have to be careful! See that when , then our problem doesn't get fulfilled. The only that satisfies that is . So, we have: ; . Adding them up gives a total of workable 's.
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.