Write . Its three roots have modulus and arguments , with . Thus all three complex roots are
Further integer values of repeat these roots.
Resultant Created 2026-09-24 Updated 2026-10-18
The resultant turns a shared-root of a polynomial question into a calculation using only coefficients. For nonconstant univariate polynomials over a field , with their actual polynomial degrees , define
where is the Sylvester matrix. Then
Here is an algebraic closure. The common root need not lie in : two real polynomials may share a nonreal complex root. The subscript identifies which variable is eliminated.[ref]
The useful surprise is that a determinant detects a shared root of a polynomial without first finding either list of roots of a polynomial. If the coefficients depend on a parameter, the resultant itself is a polynomial in that parameter. Its zeros pick out possible exceptional parameter values. Elimination theory uses this to reduce a pair of polynomial equations in two variables to a single necessary equation in one variable; eliminating a variable with a resultant gives an exact example below.
A nonzero resultant also supplies a certificate that and are coprime polynomials. The Sylvester matrix then solves for polynomials satisfying , a Bézout's identity for polynomials. Evaluating such an identity at a hypothetical common root would give .