On the reducibility type of trinomials (Q2883256)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the reducibility type of trinomials |
scientific article; zbMATH DE number 6033772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the reducibility type of trinomials |
scientific article; zbMATH DE number 6033772 |
Statements
On the reducibility type of trinomials (English)
0 references
11 May 2012
0 references
trinomial
0 references
reducibility
0 references
In this paper the polynomials have rational coefficients. A trinomial is said to have reducibility type \((n_1, \ldots, n_k)\) if there exists a factorization of this trinomial into irreducible polynomials of degrees \(n_1\), \dots, \( n_k\). The main contribution concerns the reducibility type of trinomials of degrees \(4\), \(5\) and \(6\). The results are very detailed.
0 references
0.8288342356681824
0 references
0.8239272236824036
0 references
