The difficult proof of the corrected Sister Beiter conjecture
Cyclotomic Polynomials The \(n\)-th roots of unity are the solutions of the equation \(x^n-1=0\). Except for \(n=1\) the polynomial \(x^n-1\) is always reducible, for example \(x^4-1=(x^2+1)(x+1)(x-1)\). One can wonder how \(x^n-1\) factors into irreducibles over […]