Skip to main content
OlympiadHQ

Browse · MathNet

Print

2025 International Mathematical Olympiad China National Team Selection Test

China 2025 algebra

Problem

Find the smallest real number such that there exist complex numbers with satisfying: for any complex number with ,
Solution
Let denote the maximum squared modulus of the polynomial on the unit circle. By choosing a unit complex number with and considering , we may assume without loss of generality that . Thus we only need to consider polynomials of the form .

First consider the symmetric case . The polynomial factors as . For on the unit circle (), we have: Let . We seek to minimize . Heuristically, the minimum occurs when has a double root at and a simple root at 1. Solving gives . Indeed, for this value: For the general case where , consider evaluated at the "endpoint": and at the point (corresponding to a possible vertex of ): We have ---

This shows that a certain weighted average of them equals , therefore when we always have For general , we still attempt to prove . Let be a primitive cube root of unity. Since , we have and , all corresponding to the same value. Moreover, , and at least one of these has real part . Without loss of generality, assume with . Since , we have being purely imaginary. We may assume (otherwise consider the reciprocal polynomial which has the same value). Thus , and . Now we can express: Note that is real. Writing the unit complex number , we have , , and . Therefore: To prove , we want to show: First, for (where and ), we have . Comparing with the case , consider: ---

Second, since , we have , and: Therefore: We want , which holds if: i.e., when: Through appropriate substitutions or transformations, we have ensured and . If , then , meaning a certain weighted average of and is , so . If , then . Since: we have: Therefore, we always have , and equality can be achieved. Thus, the minimal real number we seek is . □
Final answer
2√5 - 2

Techniques

Complex numbersPolynomial operationsRoots of unity