A simple algorithm for GCD of polynomials

• Egile Nagusiak: Pasquale Nardone (Egilea), Giorgio Sonnino (Egilea)
• Formatua: Liburua
• Argitaratua: Annals of Mathematics and Physics - Peertechz Publications, 2022-12-23.
• Gaiak: Research Article
• Sarrera elektronikoa: Connect to this object online.

<p>Based on the Bezout approach we propose a simple algorithm to determine the gcd of two polynomials that don't need division, like the Euclidean algorithm, or determinant calculations, like the Sylvester matrix algorithm. The algorithm needs only n steps for polynomials of degree n. For...