Irreducibility criteria for compositions of polynomials with integer coefficients (Q515627): Difference between revisions
From MaRDI portal
Latest revision as of 13:10, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Irreducibility criteria for compositions of polynomials with integer coefficients |
scientific article |
Statements
Irreducibility criteria for compositions of polynomials with integer coefficients (English)
0 references
16 March 2017
0 references
The authors prove several results about the irreducibility of polynomials of the form \(F(G(x))\), where \(F\) is a quadratic irreducible polynomial and \(G\) is a polynomial of arbitrary degree. This is the case, for instance, for \(F(x)=ax^2+bx+c \in {\mathbb Z}[x]\), where \(a=pq\) with \(p\) prime and \(q \in {\mathbb Z}\) such that \(p\) does not divide \(cq\), and any non-constant polynomial \(G \in {\mathbb Z}[x]\) whose leading coefficient is not divisible by \(p\) (Theorem 1). Three other (more technical) theorems of this type are also proved.
0 references
irreducible polynomials
0 references
compositions of polynomials
0 references
prime numbers
0 references
0 references