Pedro Hugo García Peláez
Abstract
With this algorithm you can easily find the greatest common divisor of two numbers even with large numbers of figures and the same can be done if you want to find the greatest common divisor of polynomials easily and also complex numbers.
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 easily find the greatest common divisor of two numbers even with large numbers of figures and the same can be done if you want to find the greatest common divisor of polynomials easily and also complex numbers.
Key concepts: Greatest common divisor, Divisor (algebraic geometry), Divisor function, Mathematics, Least common multiple, Combinatorics, Function (biology), Generating function