Hostname: page-component-7479d7b7d-qs9v7 Total loading time: 0 Render date: 2024-07-08T16:30:06.620Z Has data issue: false hasContentIssue false

On reductibility of trinomials

Published online by Cambridge University Press:  18 May 2009

Andrew Bremner
Affiliation:
Emmanuel College, Cambridge CB2 3AP
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In Schinzel [1] the following interesting question is asked: does there exist an absolute constant K such that every trinomial in ℚ[x] has a factor irreducible in ℚ[x] which has at most K terms? The only known result appears to be that of Mrs. H. Smyczek, given in the above paper, that if K exists, then K ≥ 6. We here extend this bound to K ≥ 8 by exhibiting a trinomial in ℤ[x] which splits into the product of two irreducible factors, each having 8 terms.

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1981

References

REFERENCE

1.Schinzel, A., Some unsolved problems on polynomials, Mat. Biblioteka 25 (1963), 6370.Google Scholar