Let $n\ge 2$ be a positive integer such that the set of $n$th roots of unity has less than $2^{\lfloor\sqrt n\rfloor}-1$ subsets with the sum $0$. Show that $n$ is a prime number. Cristi Săvescu
Source: Romanian NMO 2021 grade 10 P3
Tags: number theory, prime numbers
Let $n\ge 2$ be a positive integer such that the set of $n$th roots of unity has less than $2^{\lfloor\sqrt n\rfloor}-1$ subsets with the sum $0$. Show that $n$ is a prime number. Cristi Săvescu