Maths Olympiad Prep

Library / /72 of 520

Algebra Difficulty 5.5 AIME, harder Find the answer

Determine all functions f:RRf: \mathbb{R} \rightarrow \mathbb{R} with the property

f(f(x)+y)=2x+f(f(y)x) f(f(x)+y)=2 x+f(f(y)-x)

for all x,yRx, y \in \mathbb{R}.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

For any real number zz, we set a=f(z),b=z+f(0),n=f(a+b2)a=f(z), b=z+f(0), n=f\left(\frac{a+b}{2}\right), and m=f(0)a+b2m=f(0)-\frac{a+b}{2}. Since Df=R\mathbb{D}_{f}=\mathbb{R}, a,b,na, b, n, and mm are well-defined. Substituting x=0x=0, y=zy=z into ()(*) yields f(z+f(0))=f(f(z))f(z+f(0))=f(f(z)), so f(a)=f(b)f(a)=f(b) (I).
Substituting x=mx=m and y=ay=a or y=by=b into ()(*) yields {f(f(m)+a)=2m+f(f(a)m)f(f(m)+b)=2m+f(f(b)m)\left\{\begin{array}{l}f(f(m)+a)=2 m+f(f(a)-m) \\ f(f(m)+b)=2 m+f(f(b)-m)\end{array}\right., which, due to (I), can be summarized as f(f(m)+a)=f(f(m)+b)f(f(m)+a)=f(f(m)+b) (II).
Substituting x=ax=a or x=bx=b and y=ny=n into ()(*) yields {f(f(a)+n)=2a+f(f(n)a)f(f(b)+n)=2b+f(f(n)b)\left\{\begin{array}{l}f(f(a)+n)=2 a+f(f(n)-a) \\ f(f(b)+n)=2 b+f(f(n)-b)\end{array}\right., which, due to (I), can be summarized as 2a+f(f(n)a)=2b+f(f(n)b)2 a+f(f(n)-a)=2 b+f(f(n)-b) (III). Substituting x=a+b2,y=0x=\frac{a+b}{2}, y=0 into ()(*) yields f(f(a+b2))=a+b+f(f(0)a+b2)f\left(f\left(\frac{a+b}{2}\right)\right)=a+b+f\left(f(0)-\frac{a+b}{2}\right), so f(n)=a+b+f(m)f(n)=a+b+f(m) or, in other words, f(n)a=f(m)+bf(n)-a=f(m)+b and f(n)b=f(m)+af(n)-b=f(m)+a. This, combined with (III), immediately gives 2a+f(f(m)+b)=2b+f(f(m)+a)2 a+f(f(m)+b)=2 b+f(f(m)+a), from which, with (II), we conclude a=ba=b, so f(z)=z+f(0)f(z)=z+f(0). This shows that any function ff that satisfies ()(*) must have the form f(x)=x+c(c=f(x)=x+c \quad(c= const. ). Substituting into ()(*) confirms that any ff of this form indeed satisfies the given equation: f(f(x)+y)=x+y+2c=2x+f(f(y)x)f(f(x)+y)=x+y+2 c=2 x+f(f(y)-x).
Note: Additional properties of ff, such as injectivity, monotonicity, or differentiability, should not be assumed but must be proven.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.