Maths Olympiad Prep

Library / Stars of Mathematics Competition /1 of 7

Stars of Mathematics Competition

Number theory Difficulty 5.2 AIME, harder Prove it Romania

If nn is an integer, n≥3n \ge 3, and a1,a2,…,ana_1, a_2, \dots, a_n are non-zero integers such that
a1a2⋯an(1a12+1a22+⋯+1an2) a_1 a_2 \cdots a_n \left( \frac{1}{a_1^2} + \frac{1}{a_2^2} + \cdots + \frac{1}{a_n^2} \right)
is an integer, does it follow that the product a1a2⋯ana_1 a_2 \cdots a_n is divisible by each ai2a_i^2?

Solution

The answer is in the affirmative. To prove this, begin by noticing that the rational numbers bi=a1a2⋯an/ai2b_i = a_1 a_2 \cdots a_n / a_i^2, i=1,2,…,ni = 1, 2, \dots, n, are the roots of the degree nn monic polynomial f=Xn−s1Xn−1+s2Xn−2−⋯+(−1)n−1sn−1X+(−1)nsnf = X^n - s_1 X^{n-1} + s_2 X^{n-2} - \dots + (-1)^{n-1} s_{n-1} X + (-1)^n s_n, where
sk=∑∣I∣=k∏i∈Ibi=∑∣I∣=k(∏i∈Iai)k−2(∏i∉Iai)k,k=1,2,…,n. s_k = \sum_{|I|=k} \prod_{i \in I} b_i = \sum_{|I|=k} \left( \prod_{i \in I} a_i \right)^{k-2} \left( \prod_{i \notin I} a_i \right)^k, \quad k = 1, 2, \dots, n.
Clearly, s2,…,sns_2, \dots, s_n are all integral. Since s1s_1 is integral, by hypothesis, and ff is monic, it follows that the bib_i are all integral. (A rational root of a monic polynomial with integral coefficients is necessarily integral.)

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.