An irreducible polynomial is a nonconstant polynomial that cannot be written as a product of two nonconstant polynomials over its coefficient field. Over a general integral domain, neither factor may be a unit.
If is an irreducible polynomial over a field , then a nonzero residue modulo has . The Euclidean algorithm supplies , giving inverse for . Thus the quotient ring is a field. If and has elements, polynomial division supplies exactly residue classes.

Ancestors (5)

  1. Polynomial
  2. Algebra
  3. Area of mathematics
  4. Mathematics
  5. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (2)