Maths Olympiad Prep

Library / /61 of 69

, 2011

Algebra Difficulty 6.4 National Olympiad Prove it South Africa

Let f:Q+R+f: \mathbb{Q}^{+} \to \mathbb{R}^{+} be a function that satisfies
f(x+y)f(xy)=4f(x)f(y) f(x + y) - f(x - y) = 4\sqrt{f(x)f(y)}
for all 0<y<x0 < y < x.
(a) Prove that f(2x)=4f(x)f(2x) = 4f(x) for all xQ+x \in \mathbb{Q}^{+}.
(b) Find all such functions.

Solution

Choose any positive rational p,qp, q and let x=p+q2x = \frac{p+q}{2} and y=pq2y = \frac{p-q}{2}. Then
f(p)f(q)=4f(x)f(y)>0, f(p) - f(q) = 4\sqrt{f(x)f(y)} > 0,
so f(p)>f(q)f(p) > f(q) and hence ff is strictly increasing.

Now we show that ff has values arbitrarily close to 00, i.e., for any ϵQ+\epsilon \in \mathbb{Q}^+, we can find xx such that f(x)<ϵf(x) < \epsilon. Substituting x=2yx = 2y gives
f(3y)f(y)=4f(2y)f(y)>4f(y)f(y)=4f(y), f(3y) - f(y) = 4\sqrt{f(2y)f(y)} > 4\sqrt{f(y)f(y)} = 4f(y),
and hence f(3y)>5f(y)f(3y) > 5f(y) or f(y)<f(3y)5f(y) < \frac{f(3y)}{5}. Substituting this into itself gives f(y)<f(32y)52f(y) < \frac{f(3^2y)}{5^2}, and repeating gives f(y)<f(3ky)5kf(y) < \frac{f(3^ky)}{5^k}. Now let y=13ky = \frac{1}{3^k}, giving f(13k)<f(1)5kf(\frac{1}{3^k}) < \frac{f(1)}{5^k}. Since f(1)f(1) does not depend on kk, we can choose kk sufficiently large so that f(1)5k\frac{f(1)}{5^k} is less than ϵ\epsilon and hence yy satisfies the condition.

Consider the original equation again, and consider what happens as f(y)f(y) tends to zero. f(x)f(x) stays fixed so 4f(x)f(y)4\sqrt{f(x)f(y)} can be made arbitrarily small. Also, f(x)f(x) lies between f(xy)f(x-y) and f(x+y)f(x+y), so for any δ\delta we can choose a yy such that f(x)δ<f(xy)<f(x)<f(x+y)<f(x)+δf(x) - \delta < f(x-y) < f(x) < f(x+y) < f(x) + \delta.

Now let x=z+ϵx = z + \epsilon and x=zϵx = z - \epsilon. The original equation becomes
f(2z)=4f(z+ϵ)f(zϵ)+f(2ϵ). f(2z) = 4\sqrt{f(z + \epsilon)f(z - \epsilon)} + f(2\epsilon).
By choosing ϵ\epsilon sufficiently small, we can ensure that f(ϵ)f(\epsilon) is arbitrarily close to zero and f(z+ϵ)f(z + \epsilon) and f(zϵ)f(z - \epsilon) are arbitrarily close to f(z)f(z). The right hand side can thus be made arbitrarily close to 4f(z)4f(z), and it follows that the left hand side must be 4f(z)4f(z).

We can extend f(2z)=4f(z)f(2z) = 4f(z) to f(nz)=n2f(z)f(nz) = n^2 f(z) for all positive integers nn. For n=1n = 1 and n=2n = 2 we already have it. Suppose it holds up to some nn. We now show that it also holds for n+1n + 1. Let x=nx,y=xx = nx, y = x, giving
f((n+1)x)=4f(nx)f(x)+f((n1)x)=4n2f(x)f(x)+(n1)2f(x)=4nf(x)+(n1)2f(x)=(n+1)2f(x). \begin{aligned} f((n + 1)x) &= 4\sqrt{f(nx)f(x)} + f((n - 1)x) \\ &= 4\sqrt{n^2 f(x)f(x)} + (n - 1)^2 f(x) \\ &= 4n f(x) + (n - 1)^2 f(x) \\ &= (n + 1)^2 f(x). \end{aligned}
The result follows by induction.

We can further extend this to positive rational coefficients. Let n,mn, m be positive integers. n2f(x)=f(mnmx)=m2f(nmx)n^2 f(x) = f(m \cdot \frac{n}{m} \cdot x) = m^2 f(\frac{n}{m} \cdot x), from which it follows that f(nmx)=(nm)2f(x)f(\frac{n}{m} \cdot x) = (\frac{n}{m})^2 f(x).

Now let f(1)=af(1) = a. By the above, f(x)=ax2f(x) = a x^2 for all positive rationals xx. Conversely, it is trivial to substitute this into the original equation to confirm that it is a valid solution, for any aQ+a \in \mathbb{Q}^+.

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.