Maths Olympiad Prep

Library / /5 of 11

, 2013

Algebra Difficulty 7.8 National olympiad, round 2 Prove it Saudi Arabia

Let f(X)=anXn+an1Xn1++a1X+pf(X) = a_{n} X^{n} + a_{n-1} X^{n-1} + \cdots + a_{1} X + p be a polynomial of integer coefficients where pp is a prime number. Assume that
p>i=1nai. p > \sum_{i=1}^{n} \left| a_{i} \right| .

Prove that f(X)f(X) is irreducible.

Solution

Assume that there exist two non-constant polynomials g(X)g(X) and h(X)h(X) with integer coefficients such that f(X)=g(X)h(X)f(X) = g(X) h(X). Because p=g(0)h(0)p = g(0) h(0) is prime, we can assume that g(0)=1|g(0)| = 1.

Because the modulus of the product of the complex roots of g(X)g(X) is equal to 11, at least one of these roots, say ω0\omega_{0}, has modulus less than or equal to 11. But f(ω0)=0f\left(\omega_{0}\right) = 0. We deduce that
p=anω0n+an1ω0n1++a1ω0anω0n+an1ω0n1++a1ω0an+an1++a1 \begin{aligned} p & = \left| a_{n} \omega_{0}^{n} + a_{n-1} \omega_{0}^{n-1} + \cdots + a_{1} \omega_{0} \right| \\ & \leq \left| a_{n} \right| \cdot \left| \omega_{0} \right|^{n} + \left| a_{n-1} \right| \cdot \left| \omega_{0} \right|^{n-1} + \cdots + \left| a_{1} \right| \cdot \left| \omega_{0} \right| \\ & \leq \left| a_{n} \right| + \left| a_{n-1} \right| + \cdots + \left| a_{1} \right| \end{aligned}
which is a contradiction. Therefore, f(X)f(X) is irreducible.

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 and solution reproduced as published; topic and difficulty added by this site.