Maths Olympiad Prep

Library / /81 of 133

Algebra Difficulty 5.7 AIME, harder Prove it Saudi Arabia

Determine all functions f:[0,)Rf:[0, \infty) \rightarrow \mathbb{R} such that f(0)=0f(0)=0 and
f(x)=1+5f(x2)6f(x4) f(x)=1+5 f\left(\left\lfloor\frac{x}{2}\right\rfloor\right)-6 f\left(\left\lfloor\frac{x}{4}\right\rfloor\right)
for all x>0x>0.

Solution

Let x0x \geq 0. If x(0,2)x \in (0,2) then f(x)=1+5f(0)6f(0)=1f(x)=1+5 f(0)-6 f(0)=1.
If x[2,4)x \in [2,4) then f(x)=1+5f(1)6f(0)=6=a1f(x)=1+5 f(1)-6 f(0)=6=a_{1}.
If x[4,8)x \in [4,8) then x2[2,4)\left\lfloor\frac{x}{2}\right\rfloor \in [2,4) and x4[1,2)\left\lfloor\frac{x}{4}\right\rfloor \in [1,2), and therefore f(x)=1+5661=25=a2f(x)=1+5 \cdot 6-6 \cdot 1=25=a_{2}.

Assume for n1n \geq 1, that function ff is constant on [2n,2n+1)[2^{n}, 2^{n+1}) taking a value ana_{n}, and constant on [2n+1,2n+2)[2^{n+1}, 2^{n+2}) taking a value an+1a_{n+1}, and let x[2n+2,2n+3)x \in [2^{n+2}, 2^{n+3}). Because x2[2n+1,2n+2)\left\lfloor\frac{x}{2}\right\rfloor \in [2^{n+1}, 2^{n+2}) and x4[2n,2n+1)\left\lfloor\frac{x}{4}\right\rfloor \in [2^{n}, 2^{n+1}), we deduce that f(x)=1+5an+16anf(x)= 1+5 a_{n+1}-6 a_{n}. Therefore, function ff is also constant on [2n+2,2n+3)[2^{n+2}, 2^{n+3}) taking the value an+2=1+5an+16ana_{n+2}=1+5 a_{n+1}-6 a_{n}, which can be rewritten
an+212=5(an+112)6(an12). a_{n+2}-\frac{1}{2}=5\left(a_{n+1}-\frac{1}{2}\right)-6\left(a_{n}-\frac{1}{2}\right) .
Because the roots of the characteristic polynomial X25X+6X^{2}-5 X+6 are 22 and 33, there exist two real numbers u,vu, v such that
an=12+2nu+3nv, for all n1 a_{n}=\frac{1}{2}+2^{n} u+3^{n} v, \quad \text{ for all } n \geq 1
Because a1=6a_{1}=6 and a2=25a_{2}=25, we have u=4u=-4 and v=92v=\frac{9}{2}. We deduce that
f(x)={0 if x=01 if x(0,2)2n+2+3n+2+12 if x[2n,2n+1) and n1 f(x)= \begin{cases}0 & \text{ if } x=0 \\ 1 & \text{ if } x \in (0,2) \\ -2^{n+2}+\frac{3^{n+2}+1}{2} & \text{ if } x \in [2^{n}, 2^{n+1}) \text{ and } n \geq 1\end{cases}

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.