Maths Olympiad Prep

Library / /115 of 120

, 2012

Algebra Difficulty 6.7 National olympiad Prove it Saudi Arabia

Let Q\mathbb{Q} be the set of rational numbers. Find all functions f:QQf: \mathbb{Q} \to \mathbb{Q} such that for all rational numbers x,yx, y,
f(f(x)+xf(y))=x+f(x)y. f(f(x) + x f(y)) = x + f(x)y.

Solutions — 2

Solution 1

Solution 1. We show f(x)=xf(x) = x is the only solution. It is easy to check that it works.

Put in y=0y = 0 to obtain that ff is surjective. Let cc be a real with f(c)0f(c) \neq 0 and suppose f(a)=f(b)f(a) = f(b). Then
a=f(f(c)+cf(a))cf(c)=f(f(c)+cf(b))cf(c)=b, a = \frac{f(f(c) + c f(a)) - c}{f(c)} = \frac{f(f(c) + c f(b)) - c}{f(c)} = b,
so ff is also injective.

Let zz be the real number such that f(z)=0f(z) = 0. Then x=zx = z gives f(zf(y))=zf(z f(y)) = z. Choosing yy such that f(y)=1f(y) = 1 or f(y)=0f(y) = 0, possible by surjectivity, shows that f(z)=f(0)=zf(z) = f(0) = z. By injectivity z=0z = 0, so f(0)=0f(0) = 0.

Put in x=y=1x = y = -1 to obtain f(1)=1f(-1) = -1. Put in y=1y = -1 to get f(f(x)x)=xf(x)f(f(x) - x) = x - f(x). Let d=f(1)1d = f(1) - 1; with x=1x = 1 our previous equation this gives us f(d)=df(d) = -d. Put in x=d,y=1x = d, y = 1 to get f(df(1)d)=f(d2)=0f(d f(1) - d) = f(d^2) = 0. By injectivity, d=0d = 0 and so f(1)=1f(1) = 1.

Put in y=0y = 0 to obtain f(f(x))=xf(f(x)) = x. Now put in x=1x = 1 and change yy to f(y)f(y) to get f(1+y)=1+f(y)f(1 + y) = 1 + f(y). This implies f(n)=nf(n) = n for all integers nn. Finally, for arbitrary integers m,nm, n with n0n \neq 0, put in x=n,y=mnx = n, y = \frac{m}{n} to get f(n+nf(mn))=n+m=f(n+m)f(n + n f(\frac{m}{n})) = n + m = f(n + m). By injectivity, nf(mn)=mn f(\frac{m}{n}) = m, so f(mn)=mnf(\frac{m}{n}) = \frac{m}{n}. Since mn\frac{m}{n} is an arbitrary rational number, f(x)=xf(x) = x for all xx in the domain.

Solution 2

Solution 2. Put in x=0x = 0 to obtain f(f(0))=f(0)yf(f(0)) = f(0)y for all rational yy. Thus f(0)=0f(0) = 0 since f(0)yf(0)y is constant. Now put in y=0y = 0 to get f(f(x))=xf(f(x)) = x.

Let y=f(1)y = f(1). We get f(f(x)+x)=x+f(x)f(1)f(f(x) + x) = x + f(x)f(1). If we replace xx with f(x)f(x), then by f(f(x))=xf(f(x)) = x we get f(f(x)+x)=f(x)+xf(1)f(f(x) + x) = f(x) + x f(1). Thus x+f(x)f(1)=f(x)+xf(1)x + f(x)f(1) = f(x) + x f(1), or (f(1)1)(xf(x))=0(f(1) - 1)(x - f(x)) = 0. Putting in x=1x = 1 gives us f(1)=1f(1) = 1.

Put x=1x = 1 into the given equation to get f(y)+1=f(y+1)f(y) + 1 = f(y + 1). This implies f(y+n)=f(y)+nf(y + n) = f(y) + n for all integers nn. Since f(0)=0f(0) = 0, f(n)=nf(n) = n for all integers nn. Finally, let x=2qx = \frac{2}{q} and y=qy = q where 2q\frac{2}{q} is an arbitrary rational. This gives us f(f(2q)+p)=2q+f(2q)qf(f(\frac{2}{q}) + p) = \frac{2}{q} + f(\frac{2}{q})q. But f(f(2q)+p)=f(f(2q))+p=2q+pf(f(\frac{2}{q}) + p) = f(f(\frac{2}{q})) + p = \frac{2}{q} + p, so 2q+p=2q+f(2q)q\frac{2}{q} + p = \frac{2}{q} + f(\frac{2}{q})q and f(2q)=2qf(\frac{2}{q}) = \frac{2}{q}. Since 2q\frac{2}{q} was arbitrary, f(x)=xf(x) = x for all xx, and this clearly satisfies the 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.