IMC 2018, Day 1, Problem 5
Let and be prime numbers with . Suppose that in a convex polygon all angles are equal and the side lengths are distinct positive integers. Prove that
holds for every integer with .
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
(Proposed by Ander Lamaison Vidarte, Berlin Mathematical School, Berlin)
Solution. Place the polygon in the complex plane counterclockwise, so that is a positive real number. Let , which is an integer, and define the polynomial . Let ; then , so .
The minimal polynomial of over is the cyclotomic polynomial , so divides . At the same time, is the greatest common divisor of and , so by Bézout's identity (for real polynomials), we can write , with some polynomials . These polynomials can be replaced by and , so without loss of generality we may assume that . Since , this forces .
Let and . Denote by the unique integer with and . By the choice of and , we have . Then
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.