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 such that the polynomial f_N(x) = x^N c(x^{-1}) + d(x) is irreducible over , where are polynomials with nonzero constant terms and satisfying suitable conditions. As an application, we show that is irreducible for all and . We also give a complete description of the factorization of polynomials of the form with , .
Recommendations
Cited in
(8)- On a class of lacunary almost Newman polynomials modulo p and density theorems
- On the Irreducibility of Polynomials with Leading Coefficient Divisible by a Large Prime Power
- The Irreducibility of Polynomials That Have One Large Coefficient and Take a Prime Value
- Polynomials whose coefficients are Stern numbers
- Practical aspects of testing the irreducibility of the non-reciprocal part of a 0,1-polynomial
- On the irreducibility of the non-reciprocal part of polynomials of the form \(f(x)x^n+g(x)\)
- On the factorization of lacunary polynomials
- On two conjectures of irreducible polynomials
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)