|
|||||
|
|
1.Introduction |
|
| Abstract: | In this paper, we give the conception ofimplicit congruence and nonimplicit congruence in a unique factorization domain R andestablish some structures of irreducible polynomials over R. A classical result,Eisenstein's criterion, is generalized. |
| Keywords: | unique factorization domain prime element nonimplicitcongruence irreducible polynomial. |