2020 CIME II Problems/Problem 9

Revision as of 03:03, 30 November 2021 by Bhargavakanakapura (talk | contribs) (Created page with "==Solution== We can start by finding the number of solution for smaller repeptitions of <math>f</math>. Notice that we can solve <math>f(f(x))=f(x)</math> by applying the func...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Solution

We can start by finding the number of solution for smaller repeptitions of $f$. Notice that we can solve $f(f(x))=f(x)$ by applying the functional inverse $f^{-1}$ to both sides as you would to solve any equation: $f^{-1}(f(f(x)))=f^{-1}(f(x))\Longrightarrow f(x)=|x|$ (We put the absolute value bars because we know that taking the inverse of $f$ of both sides involves taking the square root of both sides, and $\sqrt{t^2}=|t|$). From here, it is easy to see that this equation has $4$ solutions at $\pm1$ and $\pm2$. We can also try for $f(f(f(x)))=f(f(x))$ (we will solve more methodically here): \[((x^2-2)^2-2)^2-2=(x^2-2)^2-2\] \[(x^2-2)^2-2)^2 = (x^2-2)^2\] \[(x^2-2)^2-2=|x^2-2|\] \[(x^2-2)^2-2=\pm(x^2-2)\] \[(x^2-2)^2=x^2 \textup{   OR   } (x^2-2)^2=-x^2+4\]The first equation yeilds $4$ results, and the second equation yields $2$ results for a total of $6$ results. It appeats that $\underbrace{f(f\cdots f}_{n\textup{ times}}(x))=\underbrace{f(f\cdots f}_{n-1\textup{ times}}(x))$ bas $2n$ real solutions. This makes logical sense considering that $f$ is an even polynomial with 2 roots. For a more formal proof, we consider $F_n(x)=\underbrace{f(f\cdots f}_{n\textup{ times}}(x))$. We are asked to find the number of solutions of the equation in the form $F_n(x)=F_{n-1}(x)$