Maths Olympiad Prep

Track / Stage 7 / 27 of 300 #1427 of 1964

Problem 1427

National olympiad second round; IMO P1/P4
Geometry Difficulty 7.0 Prove it

Consider the regular 19871987-gon A1A2...A1987A_1A_2 . . . A_{1987} with center OO. Show that the sum of vectors belonging to any proper subset of M={OAjj=1,2,...,1987}M = \{OA_j | j = 1, 2, . . . , 1987\} is nonzero.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

1. Restate the problem: We need to show that the sum of vectors belonging to any proper subset of M={OAjj=1,2,,1987} M = \{ \overrightarrow{OA_j} \mid j = 1, 2, \ldots, 1987 \} is nonzero for a regular 1987-gon with center O O .

2. Prime number property: We start by noting that 1987 is a prime number. We will prove that the result holds for any n n -gon if n n is prime.

3. Non-prime case: If n n is not prime, then n n has a divisor 1<d<n 1 < d < n . In this case, the vertices Ad,A2d,,And A_d, A_{2d}, \ldots, A_{nd} form a regular nd \frac{n}{d} -gon. The sum of the vectors corresponding to these vertices is zero because they are symmetrically distributed around the center O O .

4. Prime case: Now, suppose n n is prime. Let ζ=e2πin \zeta = e^{\frac{2\pi i}{n}} be a primitive n n -th root of unity. The problem reduces to showing that there is no proper subset I{1,2,,n} I \subset \{1, 2, \ldots, n\} such that iIζi=0 \sum_{i \in I} \zeta^i = 0 .

5. Minimal polynomial: The minimal polynomial of ζ \zeta over the rationals is the n n -th cyclotomic polynomial Φn(x)=1+x+x2++xn1 \Phi_n(x) = 1 + x + x^2 + \cdots + x^{n-1} . Since n n is prime, Φn(x) \Phi_n(x) is irreducible over the rationals.

6. **Polynomial P(x) P(x) **: Suppose there exists a subset I{1,2,,n} I \subset \{1, 2, \ldots, n\} such that iIζi=0 \sum_{i \in I} \zeta^i = 0 . Define the polynomial P(x)=iIxi P(x) = \sum_{i \in I} x^i . If P(ζ)=0 P(\zeta) = 0 , then Φn(x) \Phi_n(x) must divide P(x) P(x) .

7. Degree and coefficients: The polynomial P(x) P(x) has degree at most n1 n-1 and all coefficients are either 0 or 1. Since Φn(x) \Phi_n(x) is irreducible and has degree n1 n-1 , the only way Φn(x) \Phi_n(x) can divide P(x) P(x) is if P(x)=Φn(x) P(x) = \Phi_n(x) .

8. Contradiction: If P(x)=Φn(x) P(x) = \Phi_n(x) , then I={1,2,,n} I = \{1, 2, \ldots, n\} , which is not a proper subset. This is a contradiction, as we assumed I I was a proper subset.

9. Conclusion: Therefore, for a prime n n , the sum of vectors belonging to any proper subset of M M is nonzero.

\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.