BALKAN-SL 2009 A7
Let be a positive integer and \begin{align*} P(x) = c_0 X^n + c_1 X^{n-1} + \ldots + c_{n-1} X +c_n \end{align*} be a polynomial with integer coefficients, such that is a prime number and \begin{align*} |c_0| + |c_1| + \ldots + |c_{n-1}| < |c_n| \end{align*} Prove that the polynomial is irreducible in the
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.