MathDB
Problem 2 of Finals

Source: VI International Festival of Young Mathematicians Sozopol, Theme for 10-12 grade

January 11, 2020
combinatoricsset theory

Problem Statement

On the VI-th International Festival of Young Mathematicians in Sozopol nn teams were participating, each of which was with kk participants (n>k>1n>k>1). The organizers of the competition separated the nknk participants into nn groups, each with kk people, in such way that no two teammates are in the same group. Prove that there can be found nn participants no two of which are in the same team or group.