On the factorization of the trinomials x^n + cx^n-1 + d
The author is studying the irreducibility of \(f(x)=x^n+cx^{n-1}+\ldots+cx+c\in\mathbb{Z}[x].\) The main result is that if \(n\) and \(c\) are positive integers with \(c\geq 2,\) then the polynomials NEWLINE\[NEWLINEf(x)=x^n+\mathop\sum\limits_{j=0}^{n-1}cx^j, g(x)=x^n+\mathop\sum\limits_{j=0}^{n-1}(-1)^{n-j}cx^j, h(x)=x^n-\mathop\sum\limits_{j=0}^{n-1}cx^jNEWLINE\]NEWLINE and NEWLINE\[NEWLINEk(x)=x^n-\mathop\sum\limits_{j=0}^{n-1}(-1)^{n-j}cx^jNEWLINE\]NEWLINE are irreducible in \(\mathbb{Z}[x],\) with the exception of \(x^2\pm 4x+4.\) To prove this result a nice theorem about the factorization of trinomials of the form \(x^n\pm cx^{n-1}\pm d\) is proved. Some open questions are mentioned.
- On the factorization of \(X^ n - BX - A\)
- Some new polynomial discriminant formulas
- The factorization of \(f(x)x^{ n }+g(x)\) with \(f(x)\) monic and of degree \(\leq 2\)
- scientific article; zbMATH DE number 5931401 (Why is no real title available?)
- Elementary theory of factoring trinomials with integer coefficients over the integers
- Infinite families of non-monogenic trinomials
- scientific article; zbMATH DE number 1932275 (Why is no real title available?)
- scientific article; zbMATH DE number 7112716 (Why is no real title available?)
- Smooth values of polynomials
- Two Diophantine approaches to the irreducibility of certain trinomials
- On two conjectures of irreducible polynomials
- The limit of repetition thresholds of rich sequences
This page was built for publication: On the factorization of the trinomials \(x^n + cx^{n-1} + d\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907097)
