Maths Olympiad Prep

Library / /1 of 4

Algebra Difficulty 7.7 National Olympiad, round 2 Prove it Hong Kong

Let nn be a positive integer larger than 11, and let a0,a1,,an1a_0, a_1, \dots, a_{n-1} be integers. It is known that the equation
xn+an1xn1+an2xn2++a1x+a0=0 x^n + a_{n-1}x^{n-1} + a_{n-2}x^{n-2} + \dots + a_1x + a_0 = 0
has nn pairwise relatively prime integer roots. Prove that a0a_0 and a1a_1 are relatively prime.

Solution

Let b1,b2,,bnb_1, b_2, \dots, b_n be the integer roots. By Vieta's theorem, we have
b1b2bn=(1)na0,(1) b_1 b_2 \cdots b_n = (-1)^n a_0, \quad (1)
b1b2bn1+b1b2bn2bn++b2b3bn=(1)n1a1.(2) b_1 b_2 \cdots b_{n-1} + b_1 b_2 \cdots b_{n-2} b_n + \cdots + b_2 b_3 \cdots b_n = (-1)^{n-1} a_1. \quad (2)
Suppose on the contrary that a0a_0 and a1a_1 share a common prime factor pp. By equation (1), we have pb1b2bnp \mid b_1 b_2 \cdots b_n. WLOG assume pb1p \mid b_1. Then in equation (2), pp divides each of the first n1n-1 terms on the left and divides the term on the right. Therefore, we must have pb2b3bnp \mid b_2 b_3 \cdots b_n. This implies one of b2,b3,,bnb_2, b_3, \dots, b_n is divisible by pp, contradicting the fact that each of them is relatively prime to b1b_1. Therefore, a0a_0 and a1a_1 must be relatively prime.

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

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