Subcontests
(4)Graph Theory problem
In a mathematical competition, some competitors are friends; friendship is mutual, that is, when A is a friend of B, then B is also a friend of A.
We say that n≥3 different competitors A1,A2,…,An form a weakly-friendly cycle if Ai is not a friend of Ai+1 for 1≤i≤n (where An+1=A1), and there are no other pairs of non-friends among the components of the cycle.The following property is satisfied:"for every competitor C and every weakly-friendly cycle S of competitors not including C, the set of competitors D in S which are not friends of C has at most one element"Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends.(Serbia) Functional equation in three variables
Let S be the set of positive real numbers. Find all functions f:S3→S such that, for all positive real numbers x, y, z and k, the following three conditions are satisfied:(a) xf(x,y,z)=zf(z,y,x),(b) f(x,ky,k2z)=kf(x,y,z),(c) f(1,k,k+1)=k+1.(United Kingdom)