Maths Olympiad Prep

Track / Stage 7 / 6 of 300 #1406 of 1964

Problem 1406

National Olympiad second round; IMO P1/P4
Algebra Difficulty 7.0 Multiple choice

P(x)=ax2+bx+cP(x)=ax^2+bx+c has exactly 11 different real root where a,b,ca,b,c are real numbers. If P(P(P(x)))P(P(P(x))) has exactly 33 different real roots, what is the minimum possible value of abcabc?

Pick one

Next problem →

Official solution

1. Given that P(x)=ax2+bx+c P(x) = ax^2 + bx + c has exactly one real root, we know that the discriminant of P(x) P(x) must be zero. The discriminant of a quadratic equation ax2+bx+c ax^2 + bx + c is given by:
Δ=b24ac \Delta = b^2 - 4ac
For P(x) P(x) to have exactly one real root, we must have:
Δ=0    b24ac=0 \Delta = 0 \implies b^2 - 4ac = 0

2. Since P(x) P(x) has exactly one real root, it can be written in the form:
P(x)=a(xk)2 P(x) = a(x - k)^2
where k k is the root of P(x) P(x) .

3. We need to find the minimum possible value of abc abc given that P(P(P(x))) P(P(P(x))) has exactly 3 different real roots. First, let's express P(P(x)) P(P(x)) :
P(P(x))=a(P(x)k)2=a(a(xk)2k)2 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))) :
P(P(P(x)))=a(P(P(x))k)2=a(a(a(xk)2k)2k)2 P(P(P(x))) = a(P(P(x)) - k)^2 = a\left(a(a(x - k)^2 - k)^2 - k\right)^2

5. For P(P(P(x))) P(P(P(x))) to have exactly 3 different real roots, the polynomial Q(x)=a(a(xk)2k)2k Q(x) = a\left(a(x - k)^2 - k\right)^2 - k must have exactly 3 roots. Since Q(x) 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) Q'(x) . Let's find Q(x) Q'(x) :
Q(x)=a(a(xk)2k)2k Q(x) = a\left(a(x - k)^2 - k\right)^2 - k
Q(x)=4a2(a(xk)2k)(xk) Q'(x) = 4a^2\left(a(x - k)^2 - k\right)(x - k)

7. For Q(x)=0 Q'(x) = 0 , we have two cases:
4a2(a(xk)2k)(xk)=0 4a^2\left(a(x - k)^2 - k\right)(x - k) = 0
This implies either x=k x = k or a(xk)2k=0 a(x - k)^2 - k = 0 .

8. Since k0 k \neq 0 , we solve a(xk)2k=0 a(x - k)^2 - k = 0 :
a(xk)2=k    (xk)2=ka    xk=±ka a(x - k)^2 = k \implies (x - k)^2 = \frac{k}{a} \implies x - k = \pm \sqrt{\frac{k}{a}}
x=k±ka x = k \pm \sqrt{\frac{k}{a}}

9. Therefore, the roots of P(P(P(x))) P(P(P(x))) are k k , k+ka k + \sqrt{\frac{k}{a}} , and kka k - \sqrt{\frac{k}{a}} .

10. To find the minimum possible value of abc abc , we use the fact that P(x)=a(xk)2 P(x) = a(x - k)^2 . Expanding this, we get:
P(x)=ax22akx+ak2 P(x) = ax^2 - 2akx + ak^2
Comparing with P(x)=ax2+bx+c P(x) = ax^2 + bx + c , we have:
b=2ak,c=ak2 b = -2ak, \quad c = ak^2

11. Using the condition b24ac=0 b^2 - 4ac = 0 :
(2ak)24a(ak2)=0    4a2k24a2k2=0 (-2ak)^2 - 4a(ak^2) = 0 \implies 4a^2k^2 - 4a^2k^2 = 0
This condition is satisfied.

12. To minimize abc abc :
abc=a(2ak)(ak2)=2a2k3 abc = a(-2ak)(ak^2) = -2a^2k^3
Using k=1a k = \frac{1}{a} :
abc=2a2(1a)3=2a21a3=21a=2 abc = -2a^2\left(\frac{1}{a}\right)^3 = -2a^2 \cdot \frac{1}{a^3} = -2 \cdot \frac{1}{a} = -2

The final answer is 2\boxed{-2}

Source: NuminaMath-1.5, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.