Obviously, the output of f lies in the interval (0,1) . Define g:(0,1)→(0,1) as g(x)=f(x1−1) . Then for any a,b,c∈(0,1) such that a+b+c=1 , we have g(a)=f(a1−1)=f(a1−a)=f(ab+c) . We can transform g(b) and g(c) similarly:
g(a)+g(b)+g(c)=f(ac+ab)+f(ba+bc)+f(cb+ca)
Let x=ac , y=ba , z=cb . We can see that the above expression is equal to 1 . That is, for any a,b,c∈(0,1) such that a+b+c=1 , g(a)+g(b)+g(c)=1 .
(To motivate this, one can start by writing x=ba , y=cb , z=ac , and normalizing such that a+b+c=1 .)
For convenience, we define h:(−31,32)→(−31,32) as h(x)=g(x+31)−31 , so that for any a,b,c∈(−31,32) such that a+b+c=0 , we have
h(a)+h(b)+h(c)=g(a+31)−31+g(b+31)−31+g(c+31)−31=1−1=0.
Obviously, h(0)=0 . If ∣a∣<31 , then h(a)+h(−a)+h(0)=0 and thus h(−a)=−h(a) . Furthermore, if a,b are in the domain and ∣a+b∣<31 , then h(a)+h(b)+h(−(a+b))=0 and thus h(a+b)=h(a)+h(b) .
At this point, we should realize that h should be of the form h(x)=kx . We first prove this for some rational numbers. If n is a positive integer and x is a real number such that ∣nx∣<31 , then we can repeatedly apply h(a+b)=h(a)+h(b) to obtain h(nx)=nh(x) . Let k=6h(61) , then for any rational number r=qp∈(0,31) where p,q are positive integers, we have h(r)=6p∗h(6q1)=q6p∗h(61)=kr .
Next, we prove it for all real numbers in the interval (0,31) . For the sake of contradiction, assume that there is some x∈(0,31) such that h(x)=kx . Let E=h(x)−kx , then obviously 0<∣E∣<1 . The idea is to "amplify" this error until it becomes so big as to contradict the bounds on the output of h . Let N=⌈∣E∣1⌉ , so that N≥2 and ∣NE∣≥1 . Pick any rational r∈(NN−1x,x) , so that 0<x−r<N(x−r)<x<31. All numbers and sums are safely inside the bounds of (−31,31) . Thus 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(x−r),31) gives us ∣kN(x−r)∣<∣ks∣ , and since ks=h(s)∈(−31,32) , we have kN(x−r)∈(−31,32) as well, but since NE≥1 , this means that h(N(x−r))=kN(x−r)+NE∈/(−31,32) , giving us the desired contradiction.
We now know that h(x)=kx for all 0<x<31 . Since h(−x)=−h(x) for ∣x∣<31 , we obtain h(x)=kx for all ∣x∣<31 . For x∈(31,32) , we have h(x)+h(−2x)+h(−2x)=0 , and thus h(x)=kx as well. So h(x)=kx for all x in the domain. Since h(x) is bounded by −31 and 32 , we have −21≤k≤1 . It remains to work backwards to find 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