Difference between revisions of "2020 AMC 10A Problems/Problem 22"
(→Solution 1 (Casework)) |
(→Solution 1 (Casework)) |
||
Line 43: | Line 43: | ||
As mentioned above, the three terms in the expression are <math>(a, a, a)</math>, so the sum is <math>3a</math>, which is divisible by <math>3</math>. | As mentioned above, the three terms in the expression are <math>(a, a, a)</math>, so the sum is <math>3a</math>, which is divisible by <math>3</math>. | ||
− | Therefore, the first case does not work. | + | Therefore, the first case does not work (<math><b>0</b></math> cases). |
<b>Case 2:</b> <math>n</math> divides <math>998</math> and <math>n = 2</math> | <b>Case 2:</b> <math>n</math> divides <math>998</math> and <math>n = 2</math> | ||
− | As mentioned above, in this case the terms must be <math>(a, a, a + 1)</math>, which means the sum is <math>3a + 1</math>, so the expression is not divisible by <math>3</math>. Therefore, this is <math>1</math> case that works. | + | As mentioned above, in this case the terms must be <math>(a, a, a + 1)</math>, which means the sum is <math>3a + 1</math>, so the expression is not divisible by <math>3</math>. Therefore, this is <math><b>1</b></math> case that works. |
Line 58: | Line 58: | ||
So, the total number of factors of <math>999</math> is <math>4 \cdot 2 = 8</math>. | So, the total number of factors of <math>999</math> is <math>4 \cdot 2 = 8</math>. | ||
− | However, we have to subtract <math>1</math>, because the case <math>n = 1</math> does not work, as mentioned previously. This leaves <math>8 - 1 = 7</math> cases. | + | However, we have to subtract <math>1</math>, because the case <math>n = 1</math> does not work, as mentioned previously. This leaves <math>8 - 1 = <b>7</b></math> cases. |
Line 70: | Line 70: | ||
Again, we have to subtract <math>1</math>, so this leaves <math>16 - 1 = 15</math> cases. | Again, we have to subtract <math>1</math>, so this leaves <math>16 - 1 = 15</math> cases. | ||
We have also overcounted the factor <math>2</math>, as it has been counted as a factor of <math>1000</math> and as a separate case (Case 2). | We have also overcounted the factor <math>2</math>, as it has been counted as a factor of <math>1000</math> and as a separate case (Case 2). | ||
− | <math>15 - 1 = 14</math>, so there are actually <math>14</math> valid cases. | + | <math>15 - 1 = 14</math>, so there are actually <math><b>14</b></math> valid cases. |
<b>Case 5:</b> <math>n</math> divides none of <math>\{998, 999, 1000\}</math> | <b>Case 5:</b> <math>n</math> divides none of <math>\{998, 999, 1000\}</math> | ||
− | Similar to Case 1, the value of the terms of the expression are <math>(a, a, a)</math>. The sum is <math>3a</math>, which is divisible by 3, so this case does not work. | + | Similar to Case 1, the value of the terms of the expression are <math>(a, a, a)</math>. The sum is <math>3a</math>, which is divisible by 3, so this case does not work (<math><b>0</b></math> cases). |
Revision as of 11:15, 3 February 2020
Contents
Problem
For how many positive integers is
not 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 (
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
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
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
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 (
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 (Basically Solution 1 but simpler)
- Note that this solution does not count a majority of cases, and therefore may not work with other 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
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.