MathDB
Iran NMO 2008 (Second Round) - Problem3

Source:

September 22, 2010
functionalgebra proposedalgebra

Problem Statement

Let a,b,c,a,b,c, and dd be real numbers such that at least one of cc and dd is non-zero. Let f:RR f:\mathbb{R}\to\mathbb{R} be a function defined as f(x)=ax+bcx+df(x)=\frac{ax+b}{cx+d}. Suppose that for all xRx\in\mathbb{R}, we have f(x)xf(x) \neq x. Prove that if there exists some real number aa for which f1387(a)=af^{1387}(a)=a, then for all xx in the domain of f1387f^{1387}, we have f1387(x)=xf^{1387}(x)=x. Notice that in this problem, f1387(x)=f(f((f(x))))1387 times.f^{1387}(x)=\underbrace{f(f(\cdots(f(x)))\cdots)}_{\text{1387 times}}.
Hint. Prove that for every function g(x)=sx+tux+vg(x)=\frac{sx+t}{ux+v}, if the equation g(x)=xg(x)=x has more than 22 roots, then g(x)=xg(x)=x for all xR{vu}x\in\mathbb{R}-\left\{\frac{-v}{u}\right\}.