Polynomial greatest common divisor
id:
polynomial-greatest-common-divisor-255-6434714
title:
Polynomial greatest common divisor
text:
In algebra, the greatest common divisor of two polynomials is a polynomial, of the highest possible degree, that is a factor of both the two original polynomials. This concept is analogous to the greatest common divisor of two integers. In the important case of univariate polynomials over a field the polynomial GCD may be computed, like for the integer GCD, by the Euclidean algorithm using long division. The polynomial GCD is defined only up to the multiplication by an invertible constant. The s
brand slug:
wiki
category slug:
encyclopedia
description:
Greatest common divisor of polynomials
original url:
https://en.wikipedia.org/wiki/Polynomial_greatest_common_divisor
date created:
date modified:
2024-02-02T14:33:32Z
main entity:
{"identifier":"Q7226640","url":"https://www.wikidata.org/entity/Q7226640"}
image:
fields total:
13
integrity:
14