The integers are usually written in lowest terms, i . e . their greatest common divisor should be 1.
32.
The notion of the least common multiple and greatest common divisor can also be generalized for supernatural numbers, by defining
33.
Since the last remainder is zero, the algorithm ends with 21 as the greatest common divisor of 1071 and 462.
34.
See Polynomial long division, Polynomial greatest common divisor # Euclidean division and Polynomial greatest common divisor # Pseudo-remainder sequences.
35.
See Polynomial long division, Polynomial greatest common divisor # Euclidean division and Polynomial greatest common divisor # Pseudo-remainder sequences.
36.
The requirement that the greatest common divisor ( GCD ) equal 1 is necessary in order for the Frobenius number to exist.
37.
The "'Euclidean algorithm "'is an efficient method for computing the greatest common divisor ( GCD ).
38.
A primitive polynomial is a polynomial over a unique factorization domain, such that 1 is a greatest common divisor of its coefficients.
39.
The " j " th power of a primitive root modulo p will by index calculus have index the greatest common divisor
40.
A typical example of this kind of work is the computation of polynomial greatest common divisors, which is required to simplify fractions.
