Article contents
On the number of terms in the irreducible factors of a polynomial over ℚ
Published online by Cambridge University Press: 18 May 2009
Extract
All polynomials considered in this paper belong to ℚ[x] and reducibility means reducibility over ℚ. It has been established by one of us [5] that every binomial in ℚ[x] has an irreducible factor which is either a binomial or a trinomial. He has further raised the question “Does there exist an absolute constant K such that every trinomial in ℚ[x] has a factor irreducible over ℚ which has at most K terms (i.e. K non-zero coefficients)?”
- Type
- Research Article
- Information
- Copyright
- Copyright © Glasgow Mathematical Journal Trust 1992
References
REFERENCES
- 1
- Cited by