Difference between revisions of "2020 AIME I Problems/Problem 4"
MRENTHUSIASM (talk | contribs) (→Solution 2 (Official MAA)) |
|||
Line 15: | Line 15: | ||
Suppose that <math>N</math> has the required property. Then there are positive integers <math>k</math> and <math>m</math> such that <math>N = 10^4m + 2020 = k\cdot m</math>. Thus <math>(k - 10^4)m = 2020</math>, which holds exactly when <math>m</math> is a positive divisor of <math>2020.</math> The number <math>2020 = 2^2\cdot 5\cdot 101</math> has <math>12</math> divisors: <math>1, 2, 4, 5, 10, 20, 101, 202, 404, 505, 1010</math>, and <math>2020.</math> The requested sum is therefore the sum of the digits in these divisors plus <math>12</math> times the sum of the digits in <math>2020,</math> which is | Suppose that <math>N</math> has the required property. Then there are positive integers <math>k</math> and <math>m</math> such that <math>N = 10^4m + 2020 = k\cdot m</math>. Thus <math>(k - 10^4)m = 2020</math>, which holds exactly when <math>m</math> is a positive divisor of <math>2020.</math> The number <math>2020 = 2^2\cdot 5\cdot 101</math> has <math>12</math> divisors: <math>1, 2, 4, 5, 10, 20, 101, 202, 404, 505, 1010</math>, and <math>2020.</math> The requested sum is therefore the sum of the digits in these divisors plus <math>12</math> times the sum of the digits in <math>2020,</math> which is | ||
<cmath>(1+2+4+5+1+2+2+4+8+10+2+4)+12\cdot4 = 93.</cmath> | <cmath>(1+2+4+5+1+2+2+4+8+10+2+4)+12\cdot4 = 93.</cmath> | ||
− | |||
==Solution 3== | ==Solution 3== |
Revision as of 23:45, 3 July 2021
Contents
[hide]Problem
Let be the set of positive integers
with the property that the last four digits of
are
and when the last four digits are removed, the result is a divisor of
For example,
is in
because
is a divisor of
Find the sum of all the digits of all the numbers in
For example, the number
contributes
to this total.
Solution 1
We note that any number in can be expressed as
for some integer
. The problem requires that
divides this number, and since we know
divides
, we need that
divides 2020. Each number contributes the sum of the digits of
, as well as
. Since
can be prime factorized as
, it has
factors. So if we sum all the digits of all possible
values, and add
, we obtain the answer.
Now we list out all factors of , or all possible values of
.
. If we add up these digits, we get
, for a final answer of
.
-molocyxu
Solution 2 (Official MAA)
Suppose that has the required property. Then there are positive integers
and
such that
. Thus
, which holds exactly when
is a positive divisor of
The number
has
divisors:
, and
The requested sum is therefore the sum of the digits in these divisors plus
times the sum of the digits in
which is
Solution 3
Note that for all ,
can be written as
for some positive integer
. Because
must be divisible by
,
is an integer. We now let
, where
is a multiple of
. Then
. We know
and
are integers, so for
to be an integer,
must be an integer. For this to happen,
must be a multiple of
.
is prime, so
. Because
is a multiple of
,
. So
. Be know that all
end in
, so the sum of the digits of each
is the sum of the digits of each
plus
. Hence the sum of all of the digits of the numbers in
is
.
Video Solutions
See Also
2020 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.