摘要
In this paper, we give the conception of implicit congruence and nonimplicit congruence in a unique factorization domain R and establish some structures of irreducible polynomials over R . A classical result, Eisenstein′s criterion, is generalized.
本文在唯一分解整环Ｒ上引入隐含同余和非隐含同余概念．从而获得Ｒ上多项式不可约性的若干结构．
