Year: 1995
Type: article
Abstract: the author [6] that a simplification of these methods with some additional elementary arguments lead to k(t)<<t 2/3.In this paper, we prove that yn(X) is irreducible for all but finitely many (possibly 0) positive integers n.Although the current methods lead to an effective bound on the number of reducible y,~(x), such a bound would be quite large and we do not concern ourselves with it.The coefficient of xJ in yn(x) is (2 +j) I-I~=1(2k-1) and, hence, integral.The constant term is 1.Thus, the irreducibility of yn(X) over the rationals is equivalent to the irreducibility of yn(x) over the integers.It is slightly more convenient to considerrather than y,~(x).The polynomials z~(x) are monic polynomials with integer coefficients, and yn(X) is irreducible if and only if zn(x) is irreducible.The methods we discuss here (1) The research was supported in part by the NSA under grant number MDA904-92-H-3011.
Source: Acta Mathematica
DOI: 10.1007/bf02392470
Author: Michael Filaseta
Institution: University of South Carolina
Language: English
Subfield: Applied Mathematics
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1986830223
