A quadratic polynomial with real coefficients and leading coefficient is called if the equation is satisfied by exactly three real numbers. Among all the disrespectful quadratic polynomials, there is a unique such polynomial for which the sum of the roots is maximized. What is ?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
p(p(x)) = 0 means p(x) equals one root or the other. Three solutions means one root of p equals the lowest value of p.
Solution
1. Break apart. Write , where and are the roots, with the smaller one. The roots must be real and different (otherwise there are too few solutions). Now exactly when "something" is or . So
2. How many solutions can each have? Each of these is a quadratic equation, with , or solutions. A value of cannot solve both, since . To get exactly in total, one equation has solutions and the other has exactly .
3. When does have exactly one solution? The graph of is a U-shaped parabola. A horizontal line touches it at exactly one point only when is the lowest value of , at the bottom of the U.
4. Find the lowest value. The bottom of the U is halfway between the roots, at . There
This is negative, so the root equal to it must be the smaller root (and then , being larger, gives solutions). The condition is
5. Use one variable. Let , half the distance between the roots. Then and . The sum of the roots is
6. Make the sum as large as possible. Complete the square: . The largest value is , at . (Check some values: gives , gives , gives .)
7. Find the polynomial. With : and . So
Check: the bottom of the U is at , where . Good.
8. Answer the question.
The answer is .
Why this works
looks like a hard fourth-degree equation, but it is just two ordinary quadratics: and . An odd number of solutions means a horizontal line just touches the parabola at its bottom point. That one condition links and , and "largest sum of the roots" becomes finding the top of a simple quadratic in one variable.
Alternative approach
Work with the sum . The lowest value of is . Setting it equal to , and writing , gives
For a real to exist, the discriminant must not be negative: . So , and at the double root is , giving as before.
The trap
Maximizing the sum of the solutions of p(p(x)) = 0 instead of the sum of the roots of p, or setting the larger root, not the smaller one, equal to the lowest value of p.
Concise solution
Let with real roots (if the roots were not real, would have no real solutions). Then means or . Each of these is a quadratic equation with , , or real solutions, and the solution sets are disjoint since (if , only one equation appears and it has at most solutions). Exactly three solutions in total therefore means one equation has solutions and the other has exactly , a double root.
A monic quadratic has a double root exactly when equals the minimum value of , which is attained at the vertex :
So (say) , i.e. ; in particular , and then is automatically above the minimum, so has two solutions.
Maximize . Put , so and (taking ). Then
maximized at with value . This gives and , so
Check: has vertex at with value , as required.
The answer is .
Review in the AoPS books
- Introduction to Algebra, Chapter 10: Quadratic Equations – Part 1 (§10.2, §10.3, §10.4)
- Introduction to Algebra, Chapter 16: Functions
- Intermediate Algebra, Chapter 6: Polynomial Division (§6.2, §6.4)
- Intermediate Algebra, Chapter 20: Some Advanced Strategies (§20.2)
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Substitute to simplify (u = x+1/x, shifting, scaling)