An irreducible class of polynomials over integers
Number Theory
2020-04-02 v1
Abstract
In this article, we consider polynomials of the form where is a prime power and . We will show that under the strict inequality these polynomials are irreducible for certain values of . In the case of equality, apart from its cyclotomic factors, they have exactly one irreducible non-reciprocal factor.
Cite
@article{arxiv.2004.00233,
title = {An irreducible class of polynomials over integers},
author = {Biswajit Koley and A. Satyanarayana Reddy},
journal= {arXiv preprint arXiv:2004.00233},
year = {2020}
}
Comments
12 pages