A simple algorithm for GCD of polynomials

<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...

Full description

Saved in:
Bibliographic Details
Main Authors: Pasquale Nardone (Author), Giorgio Sonnino (Author)
Format: Book
Published: Annals of Mathematics and Physics - Peertechz Publications, 2022-12-23.
Subjects:
Online Access:Connect to this object online.
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000 am a22000003u 4500
001 peertech__10_17352_amp_000065
042 |a dc 
100 1 0 |a Pasquale Nardone  |e author 
700 1 0 |a Giorgio Sonnino  |e author 
245 0 0 |a A simple algorithm for GCD of polynomials 
260 |b Annals of Mathematics and Physics - Peertechz Publications,   |c 2022-12-23. 
520 |a <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. Formal manipulations give the discriminant or the resultant for any degree without needing division or determinant calculation. </p> 
540 |a Copyright © Pasquale Nardone et al. 
546 |a en 
655 7 |a Research Article  |2 local 
856 4 1 |u https://doi.org/10.17352/amp.000065  |z Connect to this object online.