Irreducibility of polynomials with a large gap

From MaRDI portal



Abstract: We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of N>operatornamedeg(c)+operatornamedeg(d) such that the polynomial f_N(x) = x^N c(x^{-1}) + d(x) is irreducible over mathbbQ, where c,dinmathbbZ[x] are polynomials with nonzero constant terms and satisfying suitable conditions. As an application, we show that xN−kx2+1 is irreducible for all Nge5 and kin3,4,ldots,24setminus9,16. We also give a complete description of the factorization of polynomials of the form xN+kxN−1pm(lx+1) with k,linmathbbZ, keql.












This page was built for publication: Irreducibility of polynomials with a large gap

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207283)