Maths Olympiad Prep

Library / /12 of 13

, 2015

Algebra Difficulty 8.7 Shortlist Prove it Baltic Way

Let aa and bb be positive numbers. Find all pairs of functions f,g:RRf, g: \mathbf{R} \to \mathbf{R}, each assuming the value 11 and fulfilling, for any y0y \ne 0 and any xx, the equations
f(1y2g(xy)ax2)=0=g(1yf(xy)bx). f\left(\frac{1}{y^2}g(xy) - ax^2\right) = 0 = g\left(\frac{1}{y}f(xy) - bx\right).

Solution

Answer: Either f(z)=g(z)=δz,0f(z) = g(z) = \delta_{z,0} or f(z)=bzf(z) = bz and g(z)=az2g(z) = az^2.

Putting xy=wxy = w in the second equation gives
0=g(1yf(w)bwy)=g(1y(f(w)bw)) 0 = g\left(\frac{1}{y}f(w) - b\frac{w}{y}\right) = g\left(\frac{1}{y}(f(w) - bw)\right)
for all y0y \neq 0. Hence, if f(w)bwf(w) \neq bw for some ww, it must be that g(z)=0g(z) = 0 for z0z \neq 0. Since gg must assume the value 1 somewhere, g(0)=1g(0) = 1.

The function gg now being known, the first equation transforms, for x=0x = 0 and x0x \neq 0, respectively, into
f(1y2)=0andf(ax2)=0. f\left(\frac{1}{y^2}\right) = 0 \quad \text{and} \quad f(-ax^2) = 0.
Consequently, f(z)=0f(z) = 0 for z>0z > 0 or z<0z < 0. Again, ff must assume the value 1, and so f=gf = g.

There remains the case when f(z)=bzf(z) = bz for all zz. Substitute y=1y = 1 into the first equation to find b(g(x)ax2)=0b(g(x) - ax^2) = 0, so that g(z)=az2g(z) = az^2 for all zz.

One easily verifies that these two possibilities satisfy the requirements. \square

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 reproduced verbatim; metadata (topic, difficulty) added by this project.