uniolympiads Ελληνικά

IMC 2004, Day 1, Problem 2

Let P(x)=x2−1P(x) = x^2 - 1. How many distinct real solutions does the following equation have:

P(P(…(P⏟2004(x))… ))=0 ?\underbrace{P(P(\dots(P}_{2004}(x))\dots)) = 0\,?
Original from the official PDFLet P (x) = x 2 − 1. How many distinct real solutions does the following equation have: P (P (. . . (P (x)) . . . )) = 0 ? {z } | [20 points] 2004

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

Solution. Put Pn(x)=P(P(...(P(x))...))⏟nP_n(x) = \underbrace{P(P(...(P(x))...))}_{n}. As P1(x)≥−1P_1(x) \ge -1, for each x∈Rx \in R, it must be that Pn+1(x)=P1(Pn(x))≥−1P_{n+1}(x) = P_1(P_n(x)) \ge -1, for each n∈Nn \in N and each x∈Rx \in R. Therefore the equation Pn(x)=aP_n(x) = a, where a<−1a < -1 has no real solutions. Let us prove that the equation Pn(x)=aP_n(x) = a, where a>0a > 0, has exactly two distinct real solutions. To this end we use mathematical induction by nn. If n=1n = 1 the assertion follows directly. Assuming that the assertion holds for a n∈Nn \in N we prove that it must also hold for n+1n+1. Since Pn+1(x)=aP_{n+1}(x) = a is equivalent to P1(Pn(x))=aP_1(P_n(x)) = a, we conclude that Pn(x)=a+1P_n(x) = \sqrt{a+1} or Pn(x)=−a+1P_n(x) = -\sqrt{a+1}. The equation Pn(x)=a+1P_n(x) = \sqrt{a+1}, as a+1>1\sqrt{a+1} > 1, has exactly two distinct real solutions by the inductive hypothesis, while the equation Pn(x)=−a+1P_n(x) = -\sqrt{a+1} has no real solutions (because −a+1<−1-\sqrt{a+1} < -1). Hence the equation Pn+1(x)=aP_{n+1}(x) = a, has exactly two distinct real solutions.

Let us prove now that the equation Pn(x)=0P_n(x) = 0 has exactly n+1n+1 distinct real solutions. Again we use mathematical induction. If n=1n = 1 the solutions are x=±1x = \pm 1, and if n=2n = 2 the solutions are x=0x = 0 and x=±2x = \pm\sqrt{2}, so in both cases the number of solutions is equal to n+1n+1. Suppose that the assertion holds for some n∈Nn \in N. Note that Pn+2(x)=P2(Pn(x))=Pn2(x)(Pn2(x)−2)P_{n+2}(x) = P_2(P_n(x)) = P_n^2(x)(P_n^2(x) - 2), so the set of all real solutions of the equation Pn+2=0P_{n+2} = 0 is exactly the union of the sets of all real solutions of the equations Pn(x)=0P_n(x) = 0, Pn(x)=2P_n(x) = \sqrt{2} and Pn(x)=−2P_n(x) = -\sqrt{2}. By the inductive hypothesis the equation Pn(x)=0P_n(x) = 0 has exactly n+1n+1 distinct real solutions, while the equations Pn(x)=2P_n(x) = \sqrt{2} and Pn(x)=−2P_n(x) = -\sqrt{2} have two and no distinct real solutions, respectively. Hence, the sets above being pairwise disjoint, the equation Pn+2(x)=0P_{n+2}(x) = 0 has exactly n+3n+3 distinct real solutions. Thus we have proved that, for each n∈Nn \in N, the equation Pn(x)=0P_n(x) = 0 has exactly n+1n+1 distinct real solutions, so the answer to the question posed in this problem is 2005.

Transcribed from the official solutions, page 1. This transcription has not been checked a second time; if in doubt, look at the original.

Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.

How did it go?