Skip to main content
OlympiadHQ

Browse · MathNet

Print

Saudi Arabia Mathematical Competitions 2012

Saudi Arabia 2012 number theory

Problem

Let be a prime. At any vertex of a regular polygon with sides it is written an integer. For any vertex of the polygon we compute the difference between the sum of the integers written at his neighbors and his number. After that we delete all the initial integers and replace them by the new obtained integers. Prove that the integers obtained after such steps are the same modulo with the initial integers.
Solution
Let be the regular polygon and let be the integers written at its vertices, at for . Consider the polynomial with integer coefficients Applying the transformation on the coefficients of the polynomial we obtain the polynomial After steps we obtain the polynomial Finally, after steps we get But , where is a polynomial with integer coefficients. From (1) we get Therefore and have the same coefficients modulo .

---

Alternative solution.

The transformation in the problem is described by the following matrix relation After steps we get where is the square matrix in relation (1). We can write , where is the permutation matrix In we have since . From (2) it follows that in we have and we are done.

Techniques

Polynomials mod pMatricesInvariants / monovariants