IMC 2001, Day 2, Problem 1
Let be integers and be real non-negative numbers such that
Prove that each and each equals either or .
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. Multiply the left hand side polynomials. We obtain the following equalities:
Now looking at the following equations we notice that all 's must be less than or equal to 1. The same statement holds for the 's. It follows from that one of the numbers equals 0 while the other one must be 1. Follow by induction.
Transcribed from the official solutions, page 1. 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.