Difference between revisions of "2011 AIME I Problems/Problem 15"
m (→Solution 4 (Vieta's and quadratic formula)) |
m (→Solution 4 (Quadratic formula)) |
||
(One intermediate revision by the same user not shown) | |||
Line 75: | Line 75: | ||
Let us first note the obvious that is derived from Vieta's formulas: <math>a+b+c=0, ab+bc+ac=-2011</math>. Now, due to the first equation, let us say that <math>a+b=-c</math>, meaning that <math>a,b>0</math> and <math>c<0</math>. Now, since both <math>a</math> and <math>b</math> are greater than 0, their absolute values are both equal to <math>a</math> and <math>b</math>, respectively. Since <math>c</math> is less than 0, it equals <math>-a-b</math>. Therefore, <math>|c|=|-a-b|=a+b</math>, meaning <math>|a|+|b|+|c|=2(a+b)</math>. We now apply Newton's sums to get that <math>a^2+b^2+ab=2011</math>,or <math>(a+b)^2-ab=2011</math>. Solving, we find that <math>49^2-390</math> satisfies this, meaning <math>a+b=49</math>, so <math>2(a+b)=\boxed{098}</math>. | Let us first note the obvious that is derived from Vieta's formulas: <math>a+b+c=0, ab+bc+ac=-2011</math>. Now, due to the first equation, let us say that <math>a+b=-c</math>, meaning that <math>a,b>0</math> and <math>c<0</math>. Now, since both <math>a</math> and <math>b</math> are greater than 0, their absolute values are both equal to <math>a</math> and <math>b</math>, respectively. Since <math>c</math> is less than 0, it equals <math>-a-b</math>. Therefore, <math>|c|=|-a-b|=a+b</math>, meaning <math>|a|+|b|+|c|=2(a+b)</math>. We now apply Newton's sums to get that <math>a^2+b^2+ab=2011</math>,or <math>(a+b)^2-ab=2011</math>. Solving, we find that <math>49^2-390</math> satisfies this, meaning <math>a+b=49</math>, so <math>2(a+b)=\boxed{098}</math>. | ||
− | ==Solution 4 (Quadratic | + | ==Solution 4 (Quadratic)== |
From [[Vieta's Formulas]] we have <math>a + b + c = 0</math> and <math>a(b + c) + bc = -2011.</math> <math>b + c = -a \implies -a^2 + bc = -2011.</math> <math>a^2 = (b + c)^2 \implies bc + 2011 = (b + c)^2.</math> So now we have a simple looking two-variable quadratic equation. From here, we can solve for <math>c</math> in terms of <math>b</math> using the [[quadratic formula]] and see if we can do something with the discriminant. <math>bc + 2011 = b^2 + 2bc + c^2.</math> <math>c^2 + (b)c + (b^2 - 2011) = 0.</math> So <math>c = \frac{-b \pm \sqrt{8044 - 3b^2}}{2}.</math> So <math>8044 - 3b^2</math> must be a perfect square. <math>8044</math> is around <math>89^2</math>, so we can start from here and work downwards. Immediately, we see that if <math>8044 - 3b^2 = 88^2, b = 10.</math> Will this work? If <math>b = 10,</math> then <math>c</math> can be <math>-49</math> or <math>39</math>. So we have two cases: | From [[Vieta's Formulas]] we have <math>a + b + c = 0</math> and <math>a(b + c) + bc = -2011.</math> <math>b + c = -a \implies -a^2 + bc = -2011.</math> <math>a^2 = (b + c)^2 \implies bc + 2011 = (b + c)^2.</math> So now we have a simple looking two-variable quadratic equation. From here, we can solve for <math>c</math> in terms of <math>b</math> using the [[quadratic formula]] and see if we can do something with the discriminant. <math>bc + 2011 = b^2 + 2bc + c^2.</math> <math>c^2 + (b)c + (b^2 - 2011) = 0.</math> So <math>c = \frac{-b \pm \sqrt{8044 - 3b^2}}{2}.</math> So <math>8044 - 3b^2</math> must be a perfect square. <math>8044</math> is around <math>89^2</math>, so we can start from here and work downwards. Immediately, we see that if <math>8044 - 3b^2 = 88^2, b = 10.</math> Will this work? If <math>b = 10,</math> then <math>c</math> can be <math>-49</math> or <math>39</math>. So we have two cases: | ||
Line 95: | Line 95: | ||
~[[User:grogg007|grogg007]] | ~[[User:grogg007|grogg007]] | ||
− | |||
− | |||
==Solution 5 (mod to help bash)== | ==Solution 5 (mod to help bash)== |
Latest revision as of 01:50, 31 July 2025
Contents
Problem
For some integer , the polynomial
has the three integer roots
,
, and
. Find
.
Solution 1
From Vieta's formulas, we know that , and
. Thus
. All three of
,
, and
are non-zero: say, if
, then
(which is not an integer).
, let
. If
, then
and if
, then
from the fact that
. We have
Thus
. We know that
,
have the same sign, so product
is always positive. So
.
Also, if we fix ,
is fixed, so
is maximized when
. Hence,
So
. Thus we have bounded
as
, i.e.
since
. Let's analyze
. Here is a table:
![]() | ![]() |
---|---|
![]() | ![]() |
![]() | ![]() |
![]() | ![]() |
![]() | ![]() |
![]() | ![]() |
We can tell we don't need to bother with ,
, So
won't work.
,
is not divisible by
,
, which is too small to get
.
,
is not divisible by
or
or
, we can clearly tell that
is too much.
Hence, ,
.
,
.
Answer:
Solution 2
Starting off like the previous solution, we know that , and
.
Therefore, .
Substituting, .
Factoring the perfect square, we get: or
.
Therefore, a sum () squared minus a product (
) gives
..
We can guess and check different ’s starting with
since
.
therefore
.
Since no factors of can sum to
(
being the largest sum), a + b cannot equal
.
making
.
and
so
cannot work either.
We can continue to do this until we reach .
making
.
, so one root is
and another is
. The roots sum to zero, so the last root must be
.
.
Solution 3
Let us first note the obvious that is derived from Vieta's formulas: . Now, due to the first equation, let us say that
, meaning that
and
. Now, since both
and
are greater than 0, their absolute values are both equal to
and
, respectively. Since
is less than 0, it equals
. Therefore,
, meaning
. We now apply Newton's sums to get that
,or
. Solving, we find that
satisfies this, meaning
, so
.
Solution 4 (Quadratic)
From Vieta's Formulas we have and
So now we have a simple looking two-variable quadratic equation. From here, we can solve for
in terms of
using the quadratic formula and see if we can do something with the discriminant.
So
So
must be a perfect square.
is around
, so we can start from here and work downwards. Immediately, we see that if
Will this work? If
then
can be
or
. So we have two cases:
Case 1:
and
But this doesn't satisfy the equation
so this case won't work.
Case 2:
and
This works!
So our answer is
Solution 5 (mod to help bash)
First, derive the equations and
. Since the product is negative,
is negative, and
and
positive. Now, a simple mod 3 testing of all cases shows that
, and
has the repective value. We can choose
not congruent to 0, make sure you see why. Now, we bash on values of
, testing the quadratic function to see if
is positive. You can also use a delta argument like solution 4, but this is simpler. We get that for
,
. Choosing
positive we get
, so
~firebolt360
Solution 6
Note that , so
, or
. Also,
, so
. Substituting
, we can obtain
, or
. If it is not known that
is prime, it may be proved in
minutes or so by checking all primes up to
. If
divided either of
, then in order for
to contain an extra copy of
, both
would need to be divisible by
. But then
would also be divisible by
, and the sum
would clearly be divisible by
.
By LTE, if
is divisible by
and neither
are divisible by
. Thus, the only possibility remaining is if
did not divide
. Let
. Then, we have
. Rearranging gives
. As in the above solutions, we may eliminate certain values of
by using mods. Then, we may test values until we obtain
, and
. Thus,
,
, and our answer is
.
Video Solution
https://www.youtube.com/watch?v=QNbfAu5rdJI&t=26s ~ MathEx
See also
2011 AIME I (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 |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.