An irreducibility criterion for integer polynomials

Abstract: Let

f (x) = s u m l i m i t s_{i = 0}^{n} a_{i} x^{i}

be a polynomial with coefficients from the ring

m a t h b b Z

of integers satisfying either

(i)

0 < a_{0} l e q a_{1} l e q c d o t s l e q a_{k - 1} < a_{k} < a_{k + 1} l e q c d o t s l e q a_{n}

for some

k

,

0 l e q k l e q n - 1

; or

(i i)

| a_{n} | > | a_{n - 1} | + c d o t s + | a_{0} |

with

a_{0} e q 0

. In this paper, it is proved that if

| a_{n} |

or

| f (m) |

is a prime number for some integer

m

with

| m | g e q 2

then the polynomial

f (x)

is irreducible over

m a t h b b Z

.

Recommendations

Cited in

(1)

This page was built for publication: An irreducibility criterion for integer polynomials