MathDB

Irreducible polynomial over Q

Source: Schweitzer 2009

November 13, 2009

algebrapolynomialsuperior algebrasuperior algebra unsolved

Problem Statement

Prove that the polynomial f(x) \equal{} \frac {x^n \plus{} x^m \minus{} 2}{x^{\gcd(m,n)} \minus{} 1} is irreducible over

\mathbb{Q}

for all integers

n > m > 0