Maths Olympiad Prep

Library / /115 of 115

Algebra Difficulty 8.0 Shortlist Find the answer

Find all functions f:(0,)(0,)f:(0,\infty) \to (0,\infty) such that
f(x+1y)+f(y+1z)+f(z+1x)=1f\left(x+\frac{1}{y}\right)+f\left(y+\frac{1}{z}\right) + f\left(z+\frac{1}{x}\right) = 1 for all x,y,z>0x,y,z >0 with xyz=1.xyz =1.

A number or a short expression. Spacing and $ signs are ignored.

Solution

Obviously, the output of ff lies in the interval (0,1)(0,1) . Define g:(0,1)(0,1)g:(0,1)\to(0,1) as g(x)=f(1x1)g(x)=f\left(\frac1x-1\right) . Then for any a,b,c(0,1)a,b,c\in(0,1) such that a+b+c=1a+b+c=1 , we have g(a)=f(1a1)=f(1aa)=f(b+ca)g(a)=f\left(\frac1a-1\right)=f\left(\frac{1-a}a\right)=f\left(\frac{b+c}a\right) . We can transform g(b)g(b) and g(c)g(c) similarly:
g(a)+g(b)+g(c)=f(ca+ba)+f(ab+cb)+f(bc+ac)g(a)+g(b)+g(c)=f\left(\frac ca+\frac ba\right)+f\left(\frac ab+\frac cb\right)+f\left(\frac bc+\frac ac\right)
Let x=cax=\frac ca , y=aby=\frac ab , z=bcz=\frac bc . We can see that the above expression is equal to 11 . That is, for any a,b,c(0,1)a,b,c\in(0,1) such that a+b+c=1a+b+c=1 , g(a)+g(b)+g(c)=1g(a)+g(b)+g(c)=1 .
(To motivate this, one can start by writing x=abx=\frac ab , y=bcy=\frac bc , z=caz=\frac ca , and normalizing such that a+b+c=1a+b+c=1 .)
For convenience, we define h:(13,23)(13,23)h:\left(-\frac13,\frac23\right)\to\left(-\frac13,\frac23\right) as h(x)=g(x+13)13h(x)=g\left(x+\frac13\right)-\frac13 , so that for any a,b,c(13,23)a,b,c\in\left(-\frac13,\frac23\right) such that a+b+c=0a+b+c=0 , we have
h(a)+h(b)+h(c)=g(a+13)13+g(b+13)13+g(c+13)13=11=0.h(a)+h(b)+h(c)=g\left(a+\frac13\right)-\frac13+g\left(b+\frac13\right)-\frac13+g\left(c+\frac13\right)-\frac13=1-1=0.
Obviously, h(0)=0h(0)=0 . If a<13|a|<\frac13 , then h(a)+h(a)+h(0)=0h(a)+h(-a)+h(0)=0 and thus h(a)=h(a)h(-a)=-h(a) . Furthermore, if a,ba,b are in the domain and a+b<13|a+b|<\frac13 , then h(a)+h(b)+h((a+b))=0h(a)+h(b)+h(-(a+b))=0 and thus h(a+b)=h(a)+h(b)h(a+b)=h(a)+h(b) .
At this point, we should realize that hh should be of the form h(x)=kxh(x)=kx . We first prove this for some rational numbers. If nn is a positive integer and xx is a real number such that nx<13|nx|<\frac13 , then we can repeatedly apply h(a+b)=h(a)+h(b)h(a+b)=h(a)+h(b) to obtain h(nx)=nh(x)h(nx)=nh(x) . Let k=6h(16)k=6h\left(\frac16\right) , then for any rational number r=pq(0,13)r=\frac pq\in\left(0,\frac13\right) where p,qp,q are positive integers, we have h(r)=6ph(16q)=6pqh(16)=krh(r)=6p*h\left(\frac1{6q}\right)=\frac{6p}q*h\left(\frac16\right)=kr .
Next, we prove it for all real numbers in the interval (0,13)\left(0,\frac13\right) . For the sake of contradiction, assume that there is some x(0,13)x\in\left(0,\frac13\right) such that h(x)kxh(x)\ne kx . Let E=h(x)kxE=h(x)-kx , then obviously 0<E<10<|E|<1 . The idea is to "amplify" this error until it becomes so big as to contradict the bounds on the output of hh . Let N=1EN=\left\lceil\frac1{|E|}\right\rceil , so that N2N\ge2 and NE1|NE|\ge1 . Pick any rational r(N1Nx,x)r\in\left(\frac{N-1}Nx,x\right) , so that 0<xr<N(xr)<x<13.0<x-r<N(x-r)<x<\frac13. All numbers and sums are safely inside the bounds of (13,13)\left(-\frac13,\frac13\right) . Thus h(N(xr))=Nh(xr)=N(h(x)+h(r))=N(h(x)h(r))=kN(xr)+NE,h(N(x-r))=Nh(x-r)=N(h(x)+h(-r))=N(h(x)-h(r))=kN(x-r)+NE, but picking any rational number s(N(xr),13)s\in\left(N(x-r),\frac13\right) gives us kN(xr)<ks|kN(x-r)|<|ks| , and since ks=h(s)(13,23)ks=h(s)\in\left(-\frac13,\frac23\right) , we have kN(xr)(13,23)kN(x-r)\in\left(-\frac13,\frac23\right) as well, but since NE1NE\ge1 , this means that h(N(xr))=kN(xr)+NE(13,23)h(N(x-r))=kN(x-r)+NE\notin\left(-\frac13,\frac23\right) , giving us the desired contradiction.
We now know that h(x)=kxh(x)=kx for all 0<x<130<x<\frac13 . Since h(x)=h(x)h(-x)=-h(x) for x<13|x|<\frac13 , we obtain h(x)=kxh(x)=kx for all x<13|x|<\frac13 . For x(13,23)x\in\left(\frac13,\frac23\right) , we have h(x)+h(x2)+h(x2)=0h(x)+h\left(-\frac x2\right)+h\left(-\frac x2\right)=0 , and thus h(x)=kxh(x)=kx as well. So h(x)=kxh(x)=kx for all xx in the domain. Since h(x)h(x) is bounded by 13-\frac13 and 23\frac23 , we have 12k1-\frac12\le k\le1 . It remains to work backwards to find f(x)f(x) .
\begin{align*} h(x) &= kx \\ g(x) &= kx+\frac{1-k}3 \\ f(x) &= \frac k{1+x}+\frac{1-k}3\quad\left(-\frac12\le k\le1\right). \end{align*} - wzs26843545602
2018 USAMO ( Problems • Resources ) Preceded by Problem 1 Followed by Problem 3 1 • 2 • 3 • 4 • 5 • 6 All USAMO Problems and Solutions

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