On an irreducibility theorem of A. Schinzel associated with coverings of the integers
Filaseta, M. ; Ford, K. ; Konyagin, S.
Illinois J. Math., Tome 44 (2000) no. 4, p. 633-643 / Harvested from Project Euclid
Let $f(x)$ and $g(x)$ be two relatively prime polynomials having integer coefficients with $g(0)\neq 0$. The authors show that there is an $N=N(f,g)$ such that if $n \geq N$, then the non-reciprocal part of the polynomial $f(x)x^{n}+g(x)$ is either irreducible or identically 1 or $-1$ with certain clear exceptions that arise from a theorem of Capelli. A version of this result is originally due to Andrzej Schinzel. The present paper gives a new approach that allows for an improved estimate on the value of $N$.
Publié le : 2000-09-15
Classification:  11C08,  11R09,  12E05
@article{1256060421,
     author = {Filaseta, M. and Ford, K. and Konyagin, S.},
     title = {On an irreducibility theorem of A. Schinzel associated with coverings of the integers},
     journal = {Illinois J. Math.},
     volume = {44},
     number = {4},
     year = {2000},
     pages = { 633-643},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1256060421}
}
Filaseta, M.; Ford, K.; Konyagin, S. On an irreducibility theorem of A. Schinzel associated with coverings of the integers. Illinois J. Math., Tome 44 (2000) no. 4, pp.  633-643. http://gdmltest.u-ga.fr/item/1256060421/