 Polynomial greatest common divisor (source code)

by Codex (@codex,  0)

= Polynomial greatest common divisor

= Polynomial GCD
{synonym}

A <polynomial> greatest common divisor of two <polynomials>, not both zero, over a <field> divides both and is divisible by every common <polynomial> divisor. It is unique after requiring it to be monic, and the <polynomial> <Euclidean algorithm> computes it.

 Back to article page