Difference between revisions of "2019 AIME II Problems/Problem 9"
Brendanb4321 (talk | contribs) m (→Problem 9) |
The jake314 (talk | contribs) (→Solution) |
||
Line 14: | Line 14: | ||
-scrabbler94 | -scrabbler94 | ||
+ | |||
+ | ==Solution 2== | ||
==See Also== | ==See Also== | ||
{{AIME box|year=2019|n=II|num-b=8|num-a=10}} | {{AIME box|year=2019|n=II|num-b=8|num-a=10}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 15:31, 4 March 2020
Contents
[hide]Problem 9
Call a positive integer
-pretty if
has exactly
positive divisors and
is divisible by
. For example,
is
-pretty. Let
be the sum of positive integers less than
that are
-pretty. Find
.
Solution
Every 20-pretty integer can be written in form , where
,
,
, and
, where
is the number of divisors of
. Thus, we have
, using the fact that the divisor function is multiplicative. As
must be a divisor of 20, there are not many cases to check.
If , then
. But this leads to no solutions, as
gives
.
If , then
or
. The first case gives
where
is a prime other than 2 or 5. Thus we have
. The sum of all such
is
. In the second case
and
, and there is one solution
.
If , then
, but this gives
. No other values for
work.
Then we have .
-scrabbler94
Solution 2
See Also
2019 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
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.