Question 43
Let $n\geq2$ be an integer such that the set of $n$th roots of unity has fewer than $2^{\lfloor\sqrt n\rfloor}-1$ subsets whose elements sum to zero. Prove that $n$ is prime. Here $\lfloor x\rfloor$ denotes the integer part of the real number $x$.