On the reducibility of polynomials and in particular of trinomials
From MaRDI portal
Publication:5593050
DOI10.4064/aa-11-1-1-34zbMath0196.31104OpenAlexW1495060254MaRDI QIDQ5593050
Publication date: 1966
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/204744
Related Items (8)
On three questions concerning \(0,1\)-polynomials ⋮ Trinomials with integral \(S\)-unit coefficients having a quadratic factor ⋮ On arithmetic progressions in recurrences -- a new characterization of the Fibonacci sequence ⋮ The factorization of \(f(x)x^{ n }+g(x)\) with \(f(x)\) monic and of degree \(\leq 2\) ⋮ Factorization of bivariate sparse polynomials ⋮ Powers of roots in linear spaces ⋮ Algebraic integers with small absolute size ⋮ Overdetermined systems of sparse polynomial equations
This page was built for publication: On the reducibility of polynomials and in particular of trinomials
