SK 2017 Q19
19. The sequence of functions \(F_1(x)\), \(F_2(x)\), … satisfies the following conditions:
\[F_1(x) = x, \qquad F_{n+1}(x) = \dfrac{1}{1 - F_n(x)}.\]
The integer \(C\) is a three-digit cube such that \(F_C(C) = C\).
What is the largest possible value of \(C\)?
Senior Kangaroo 2017, Question 19. © UK Mathematics Trust. Original paper on ukmt.org.uk
Answer: 343
\[F_1(x) = x;\ F_2(x) = \dfrac{1}{1 - x};\ F_3(x) = \dfrac{1}{1 - \frac{1}{1 - x}} = 1 - \dfrac{1}{x};\ F_4(x) = \dfrac{1}{1 - \left(1 - \frac{1}{x}\right)} = x.\]
Hence we have, \(F_1(x) = F_4(x) = F_7(x) = \ldots = F_{3k-2}(x)\).
Therefore we are required to solve \(F_{3k-2}(3k - 2) = 3k - 2\) where \(3k - 2\) is a three-digit cube (given). The cubes are 125, 216, 343, 512, 729. The only one of the format \(3k - 2\) for some positive integer \(k\) is 343.
Solution © UK Mathematics Trust, from the SK 2017 solutions.