Pedro Hugo García Peláez
Abstract
With this algorithm you can find the greatest common divisor of two polynomials or complex numbers and of course also natural numbers in an easy way.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
With this algorithm you can find the greatest common divisor of two polynomials or complex numbers and of course also natural numbers in an easy way.
Key concepts: Divisor (algebraic geometry), Greatest common divisor, Algorithm, Mathematics, Computer science, Combinatorics