MathDB

3

Part of 2005 Czech-Polish-Slovak Match

Problems(1)

For which n is the polynomial reducible?

Source: Czech-Polish-Slovak 2005 Q3

4/27/2013
Find all integers n≥3n \ge 3 for which the polynomial W(x)=xn−3xn−1+2xn−2+6W(x) = x^n - 3x^{n-1} + 2x^{n-2} + 6 can be written as a product of two non-constant polynomials with integer coefficients.
algebrapolynomialmodular arithmeticquadraticsalgebra unsolved