Maths Olympiad Prep

Library / /1 of 12

Algebra Difficulty 4.6 AIME Prove it Bulgaria

Let f1R[x]f_1 \in \mathbb{R}[x] be a quadratic polynomial with positive leading coefficient. Set fn+1=f1fnf_{n+1} = f_1 \circ f_n for n1n \ge 1. It is known that the polynomial f2f_2 has four non-positive different zeroes. Prove that the polynomial fnf_n has 2n2^n different real zeroes.

Solution

Note that if x1,,x2nx_1, \dots, x_{2^n} are the zeroes of fnf_n, then the zeroes of fn+1f_{n+1} are the solutions of the equations f1(x)=xkf_1(x) = x_k, 1k2n1 \le k \le 2^n. Moreover, the equation f1(x)=af_1(x) = a has two different real roots if and only if a>m:=minf1a > m := \min f_1.

Assume that f2f_2 has four non-positive different zeroes. Then it is easy to see that f1f_1 has two zeroes x1<x20x_1 < x_2 \le 0 and x1>mx_1 > m. Using the argument from the beginning, it follows by induction on nn that all the zeroes of fn+1f_{n+1} are different and belong to the interval (x1,x2](x_1, x_2].

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.