MathDB
2n students in a math competition, no of ways competition is honest

Source: Ukraine TST 2018 p11

April 29, 2020
Perfect Squarecombinatorics

Problem Statement

2n2n students take part in a math competition. First, each of the students sends its task to the members of the jury, after which each of the students receives from the jury one of proposed tasks (all received tasks are different). Let's call the competition honest, if there are nn students who were given the tasks suggested by the remaining nn participants. Prove that the number of task distributions in which the competition is honest is a square of natural numbers.