olymmath

BALKAN-SL 2009 A7

    Let n≥2n\geq 2 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 ∣cn∣\mid c_n \mid is a prime number and \begin{align*} |c_0| + |c_1| + \ldots + |c_{n-1}| < |c_n| \end{align*} Prove that the polynomial P(X)P(X) is irreducible in the Z[x]\mathbb{Z}[x]

    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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator balkan-sl/2009/a7 · Tag PA6DZ0QBB1 · Edit this page on GitHub · Keys: j next, k previous