Maths Olympiad Prep

Library / /78 of 104

Algebra Difficulty 6.5 National Olympiad Prove it Bulgaria

Problem:
Find all k>0k > 0 such that there is a function f:[0,1]×[0,1][0,1]f : [0,1] \times [0,1] \to [0,1] satisfying the following conditions:

a) f(f(x,y),z)=f(x,f(y,z))f(f(x, y), z) = f(x, f(y, z));
b) f(x,y)=f(y,x)f(x, y) = f(y, x);
c) f(x,1)=xf(x, 1) = x;
d) f(zx,zy)=zkf(x,y)f(z x, z y) = z^{k} f(x, y),

for any x,y,z[0,1]x, y, z \in [0,1].

Solution

Solution:
Now let xyzx \leq y \leq z, x,y,z(0,1)x, y, z \in (0,1). Then using (a), we get that f(xyk1,z)=f(x,yzk1)f\left(x y^{k-1}, z\right) = f\left(x, y z^{k-1}\right). Hence it follows from the above that
{xyk1zk1,xk1y(k1)2z}{xyk1z(k1)2,xk1yzk1} \{x y^{k-1} z^{k-1}, x^{k-1} y^{(k-1)^2} z\} \cap \{x y^{k-1} z^{(k-1)^2}, x^{k-1} y z^{k-1}\} \neq \varnothing
This easily implies that either k=1k=1 and f(x,y)=min{x,y}f(x, y) = \min\{x, y\} or k=2k=2 and f(x,y)=xyf(x, y) = x y. A direct verification shows that both functions are solutions for the respective kk.

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.