Maths Olympiad Prep

Track / Stage 7 / 163 of 300 #1563 of 1964

Problem 1563

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

The polynomials f(x)f(x) and g(x)g(x) are given. The points A1(f(1),g(1)),,An(f(n),g(n))A_1(f(1),g(1)),\ldots,A_n(f(n),g(n)) are marked on the coordinate plane. It turns out that A1AnA_1\ldots A_n is a regular nn{}-gon. Prove that the degree of at least one of ff{} and gg{} is at least n1n-1.

Proposed by V. Bragin

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. Assume the Center of the Polygon is at the Origin:
Without loss of generality (WLOG), we can shift the coordinate system such that the center of the regular nn-gon is at the origin (0,0)(0,0).

2. Define a Complex Polynomial:
Define the complex polynomial P(x)=f(x)+ig(x) P(x) = f(x) + i g(x) . Here, f(x) f(x) and g(x) g(x) are the real and imaginary parts of P(x) P(x) , respectively. The degree of P(x) P(x) is given by degP=max(degf,degg) \deg P = \max(\deg f, \deg g) .

3. **Properties of the Regular nn-gon:**
Since A1,A2,,An A_1, A_2, \ldots, A_n form a regular nn-gon centered at the origin, the points P(1),P(2),,P(n) P(1), P(2), \ldots, P(n) must be equally spaced on the complex plane. This implies that for each integer k k from 0 0 to n2 n-2 inclusive, we have:
P(k+1)=ωP(k) P(k+1) = \omega P(k)
where ω=e2πi/n \omega = e^{2\pi i / n} is the nn-th root of unity.

4. **Construct a New Polynomial Q(x) Q(x) :**
Consider the polynomial:
Q(x)=P(x)ωP(x1) Q(x) = P(x) - \omega P(x-1)
The degree of Q(x) Q(x) is at most the degree of P(x) P(x) , i.e., degQdegP \deg Q \leq \deg P .

5. **Roots of Q(x) Q(x) :**
Notice that Q(x) Q(x) has at least n2 n-2 roots because:
Q(k+1)=P(k+1)ωP(k)=0fork=0,1,,n2 Q(k+1) = P(k+1) - \omega P(k) = 0 \quad \text{for} \quad k = 0, 1, \ldots, n-2
This implies that Q(x) Q(x) has at least n2 n-2 distinct roots.

6. **Degree of Q(x) Q(x) :**
By the Fundamental Theorem of Algebra, a polynomial with n2 n-2 roots must have a degree of at least n2 n-2 . Therefore:
degQn2 \deg Q \geq n-2

7. **Conclusion on the Degree of P(x) P(x) :**
Since degQdegP \deg Q \leq \deg P and degQn2 \deg Q \geq n-2 , it follows that:
degPn2 \deg P \geq n-2
However, since Q(x) Q(x) must have at least n1 n-1 roots to ensure the regularity of the nn-gon, we actually need:
degPn1 \deg P \geq n-1

8. **Conclusion on the Degrees of f(x) f(x) and g(x) g(x) :**
Since degP=max(degf,degg) \deg P = \max(\deg f, \deg g) , we conclude that:
max(degf,degg)n1 \max(\deg f, \deg g) \geq n-1

The final answer is max(degf,degg)n1 \boxed{ \max(\deg f, \deg g) \geq n-1 }

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