IMC 2007, Day 1, Problem 6
How many nonzero coefficients can a polynomial have if its coefficients are integers and for any complex number of unit length?
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. We show that the number of nonzero coefficients can be 0, 1 and 2. These values are possible, for example the polynomials , and satisfy the conditions and they have 0, 1 and 2 nonzero terms, respectively.
Now consider an arbitrary polynomial satisfying the conditions and assume that it has at least two nonzero coefficients. Dividing the polynomial by a power of and optionally replacing by , we can achieve such that conditions are not changed and the number of nonzero terms is preserved. So, without loss of generality, we can assume that .
Let . Our goal is to show that .
Consider those complex numbers on the unit circle for which ; namely, let
Remark. From Parseval's formula (i.e. integrating on the unit circle) it can be obtained that
It is also easy to see that equality in (4) cannot hold two or more nonzero coefficients, so it is sufficient to consider only polynomials of the form . However, we do not know (yet :-)) any simpler argument for these cases than the proof above.
Transcribed from the official solutions, page 3. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.