Let n∈N∗. Determine all functions f:R→R that satisfy: f(x+y2n)=f(f(x))+y2n−1f(y), for all x,y∈R, and for which the equation f(x)=0 has a unique solution.
Solution
For y=0, the given relation reduces to f(x)=f(f(x)), which means that the given relation becomes: f(x+y2n)=f(x)+y2n−1f(y),∀x,y∈R.(1) If we consider x=0 and y=1 in (1), then f(0)=0. Since the equation f(x)=0 has a unique solution, we have the implication: f(x)=0⇒x=0.(2) Putting x=0 in (1), we obtain f(y2n)=y2n−1f(y), for all y∈R, which means that relation (1) rewrites as: f(x+y2n)=f(x)+f(y2n),∀x,y∈R.(3) Moreover, y2n−1f(y)=f(y2n)=f((−y)2n)=−y2n−1f(−y), for all y∈R, so f is an odd function. Considering t=2ny≥0, relation (3) becomes: f(x+t)=f(x)+f(t),∀x∈R,t≥0.(4)
Using the fact that f is odd, for t<0, we obtain: f(x+t)=−f(−x−t)=−(f(−x)+f(−t))=f(x)+f(t), which, together with relation (4), implies: f(x+t)=f(x)+f(t),∀x,t∈R.(5) If f(x1)=f(x2), according to relation (5), we have f(x1−x2)=0, which, according to relation (2), implies x1=x2, meaning f is one-to-one. But since f(f(x))=f(x), we have f(x)=x, which is a solution to the given equation.
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.