Affiliation:
1. Institute of Mathematics, Faculty of Mathematics and Informatics, Vilnius University, Naugarduko 24, Vilnius LT-03225, Lithuania
Abstract
In this note, we show that, for any
and any prime number
, there exists
for which the polynomial
is irreducible over
. For composite
, this assertion is not true in general. However, it holds for any integer
if
is not of the form
, where
and
are integers and
.