Problem

Source: 5-th Hong Kong Mathematical Olympiad 2002

Tags: modular arithmetic, combinatorics unsolved, combinatorics



In conference there $n>2$ mathematicians. Every two mathematicians communicate in one of the $n$ offical languages of the conference. For any three different offical languages the exists three mathematicians who communicate with each other in these three languages. Find all $n$ such that this is possible.