Let f(X)=anXn+an−1Xn−1+⋯+a1X+p be a polynomial of integer coefficients where p is a prime number. Assume that p>i=1∑n∣ai∣.
Prove that f(X) is irreducible.
Solution
Assume that there exist two non-constant polynomials g(X) and h(X) with integer coefficients such that f(X)=g(X)h(X). Because p=g(0)h(0) is prime, we can assume that ∣g(0)∣=1.
Because the modulus of the product of the complex roots of g(X) is equal to 1, at least one of these roots, say ω0, has modulus less than or equal to 1. But f(ω0)=0. We deduce that p=anω0n+an−1ω0n−1+⋯+a1ω0≤∣an∣⋅∣ω0∣n+∣an−1∣⋅∣ω0∣n−1+⋯+∣a1∣⋅∣ω0∣≤∣an∣+∣an−1∣+⋯+∣a1∣ which is a contradiction. Therefore, 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.