Question 26
(IND) IMO2. In a contest, there are $m$ candidates and $n$ judges, where $n\ge3$ is an odd integer. Each candidate is evaluated by each judge as either pass or fail. Suppose that each pair of judges agrees on at most $k$ candidates. Prove that $\frac{k}{m}\ge\frac{n-1}{2n}$.