P(x)=ax2+bx+c has exactly 1 different real root where a,b,c are real numbers. If P(P(P(x))) has exactly 3 different real roots, what is the minimum possible value of abc?
1. Given that P(x)=ax2+bx+c has exactly one real root, we know that the discriminant of P(x) must be zero. The discriminant of a quadratic equation ax2+bx+c is given by: Δ=b2−4ac For P(x) to have exactly one real root, we must have: Δ=0⟹b2−4ac=0
2. Since P(x) has exactly one real root, it can be written in the form: P(x)=a(x−k)2 where k is the root of P(x).
3. We need to find the minimum possible value of abc given that P(P(P(x))) has exactly 3 different real roots. First, let's express P(P(x)): P(P(x))=a(P(x)−k)2=a(a(x−k)2−k)2
4. Now, we need to find P(P(P(x))): P(P(P(x)))=a(P(P(x))−k)2=a(a(a(x−k)2−k)2−k)2
5. For P(P(P(x))) to have exactly 3 different real roots, the polynomial Q(x)=a(a(x−k)2−k)2−k must have exactly 3 roots. Since Q(x) is a polynomial of degree 4, one of the roots must be repeated.
6. The repeated root must also be a root of the derivative Q′(x). Let's find Q′(x): Q(x)=a(a(x−k)2−k)2−k Q′(x)=4a2(a(x−k)2−k)(x−k)
7. For Q′(x)=0, we have two cases: 4a2(a(x−k)2−k)(x−k)=0 This implies either x=k or a(x−k)2−k=0.
8. Since k=0, we solve a(x−k)2−k=0: a(x−k)2=k⟹(x−k)2=ak⟹x−k=±ak x=k±ak
9. Therefore, the roots of P(P(P(x))) are k, k+ak, and k−ak.
10. To find the minimum possible value of abc, we use the fact that P(x)=a(x−k)2. Expanding this, we get: P(x)=ax2−2akx+ak2 Comparing with P(x)=ax2+bx+c, we have: b=−2ak,c=ak2
11. Using the condition b2−4ac=0: (−2ak)2−4a(ak2)=0⟹4a2k2−4a2k2=0 This condition is satisfied.
12. To minimize abc: abc=a(−2ak)(ak2)=−2a2k3 Using k=a1: abc=−2a2(a1)3=−2a2⋅a31=−2⋅a1=−2
The final answer is −2
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.