Difference between revisions of "2025 AIME II Problems/Problem 2"
(→Solution 1) |
(→Solution 2) |
||
Line 37: | Line 37: | ||
~scrabbler94 | ~scrabbler94 | ||
+ | |||
+ | NOTE: If you don't observe that it divides if and only if <math>n+2</math> divides <math>3(n^2+9)</math> you can still do synthetic division by expanding <math>3(n+3)(n^2+9)</math> into <math>3n^3+9n^2+27n+81</math> and get the same remainder. -unhappyfarmer | ||
==Solution 3 (modular arithmetic)== | ==Solution 3 (modular arithmetic)== |
Latest revision as of 20:37, 29 September 2025
Contents
Problem
Find the sum of all positive integers such that
divides the product
.
Solution 1
Since is positive, the positive factors of
are
,
,
, and
.
Therefore, ,
,
and
.
Since is positive,
,
and
.
is the correct answer
~ Edited by aoum
Solution 2
We observe that and
share no common prime factor, so
divides
if and only if
divides
.
By dividing either with long division or synthetic division, one obtains
. This quantity is an integer if and only if
is an integer, so
must be a factor of 39. As in Solution 1,
and the sum is
.
~scrabbler94
NOTE: If you don't observe that it divides if and only ifdivides
you can still do synthetic division by expanding
into
and get the same remainder. -unhappyfarmer
Solution 3 (modular arithmetic)
Let's express the right-hand expression in terms of mod .
.
.
since
with a quotient
This means where k is some integer.
Note that is positive, meaning
.
is one of the factors of 39, so
or
, so
or
.
The sum of all possible is
.
~Sohcahtoa157
Video Solution by Mathletes Corner
https://www.youtube.com/watch?v=WYyDe_VyvvQ
~GP102
See also
2025 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 1 |
Followed by Problem 3 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.