Gcds

Greatest Common Divisor Of Two Polynomials - Univariate Polynomials With Coefficients in A Field - Euclid's Algorithm
... define Euclid's algorithm for computing GCDs ... The GCD is the last non zero remainder ... Thus rk − 1 is a GCD of aand b ...

Red Auxiliary Number
... The red auxiliary numbers were divisors of a greatest common divisor (GCD) that was used to generally convert 2/n to optimized, but not optimal, unit fraction series ... was converted to a unit fraction series by finding the best set of divisors of (GCD) mn, as discussed below ... Scribal red numbers, LCMs and GCDs were known for over 130 years before being rigorously parsed ...