2025 AIME II Problems/Problem 15
Contents
[hide]Problem
There are exactly three positive real numbers such that the function
defined over the positive real numbers achieves its minimum value at exactly two positive real numbers
. Find the sum of these three values of
.
Solution 1 ('clunky', trial and error)
Let be the minimum value of the expression (changes based on the value of
, however is a constant). Therefore we can say that
is a constant, and for the equation to be true in all
the right side is also a quartic. The roots must also both be double, or else there is an even more 'minimum' value, setting contradiction.
We expand as follows, comparing coefficients:
Recall , so we can equate and evaluate as follows:
We now have a quartic with respect to . Keeping in mind it is much easier to guess the roots of a polynomial with integer coefficients, we set
. Now our equation becomes
If you are lucky, you should find roots and
. After this, solving the resulting quadratic gets you the remaining roots as
and
. Working back through our substitution for
, we have generated values of
as
.
However, we are not finished, trying into the equation
from earlier does not give us equality, thus it is an extraneous root. The sum of all
then must be
.
~ Edited by aoum
Note: I'm not sure what the first author meant by "or else there is an even more 'minimum' value." The most noticeable reason there are two double roots is because there are two distinct positive solutions per the conditions of the problem
~ fermat_sLastAMC
Further notes (from the author):
To clarify why the equation takes the form as above, if you do not regard the context of the problem, you could say that is another form, also having two roots. However when we consider this form, (WLOG assuming
) if we take a value such that
, then
, therefore implying that
or otherwise resulting
, which is contradiction as we assumed
is the least value of the function. Similarly logic proceeds if the third power is on the other binomial.
Solution 2 (AM-GM)
Consider this function
Let
Let
when
Let
When
Since
With same method, consider the function
In summary, .
~ Edited by dongjiu0728
Solution 3 (elegant polynomial)
We first do the same thing as Solution 1 did, but in mathematical language.
Lemma: for Polynomial , if
and
both hold, then
is a multiple root of
.
This lemma is obvious since every root of occurs
times in the derivative polynomial and any single root of
can't be a root of
.
Simply name m as the minimum value of .
Then and the equal sign holds if and only of
or
.
Define . Obviously,
and
satisfy the two properties in the lemma. So we've got:
Take
, we get:
and so on.
So we can construct
.
As what we have seen,
are four roots of
.
So we've got:
Comparing the cubic coefficient:
So
Now
are accesible in this form. The final task is to eliminate
. In this occasion the four roots are either
or
. In either way the constant coefficient of
is
But,
and
are both positive, so we end up with contradiction.
~ Edited by ThomasZZW
See also
2025 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Last Problem | |
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.