Geodesic
On reductibility of trinomials
Glasgow mathematical journal, Tome 22 (1981) no. 2, pp. 155-156

Voir la notice de l'article provenant de la source Cambridge University Press

In Schinzel [1] the following interesting question is asked: does there exist an absolute constant K such that every trinomial in Q[x] has a factor irreducible in Q[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 Z[x] which splits into the product of two irreducible factors, each having 8 terms. 
Bremner, Andrew. On reductibility of trinomials. Glasgow mathematical journal, Tome 22 (1981) no. 2, pp. 155-156. doi: 10.1017/S0017089500004602
@article{10_1017_S0017089500004602,
     author = {Bremner, Andrew},
     title = {On reductibility of trinomials},
     journal = {Glasgow mathematical journal},
     pages = {155--156},
     year = {1981},
     volume = {22},
     number = {2},
     doi = {10.1017/S0017089500004602},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500004602/}
}
TY  - JOUR
AU  - Bremner, Andrew
TI  - On reductibility of trinomials
JO  - Glasgow mathematical journal
PY  - 1981
SP  - 155
EP  - 156
VL  - 22
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089500004602/
DO  - 10.1017/S0017089500004602
ID  - 10_1017_S0017089500004602
ER  - 
%0 Journal Article
%A Bremner, Andrew
%T On reductibility of trinomials
%J Glasgow mathematical journal
%D 1981
%P 155-156
%V 22
%N 2
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089500004602/
%R 10.1017/S0017089500004602
%F 10_1017_S0017089500004602

[1] 1.Schinzel, A., Some unsolved problems on polynomials, Mat. Biblioteka 25 (1963), 63–70. Google Scholar

Cité par Sources :