reducible polynomial

reducible polynomial

[ri′dü·sə·bəl ‚päl·i′nō·mē·əl]
(mathematics)
A polynomial relative to some field which can be written as the product of two polynomials of degree at least 1.
References in periodicals archive ?
A reducible polynomial of degree n can be found by taking two polynomials, one of degree p and one of degree q, where p > 0, q > 0, p + q = n, and multiplying them together.
The goal of this paper is to give an explicit factorization over Z[[x]] for reducible polynomials of the form