Problem

Source: 2018 Saudi Arabia BMO TST I p3

Tags: combinatorics, partition



The partition of $2n$ positive integers into $n$ pairs is called square-free if the product of numbers in each pair is not a perfect square.Prove that if for $2n$ distinct positive integers, there exists one square-free partition, then there exists at least $n!$ square-free partitions.