An algorithm named for Euclid can be used to find the GCD, or to perform this operation on integers. Subtraction of two logarithms is equivalent to fi
An algorithm named for Euclid can be used to find the GCD, or to perform this operation on integers. Subtraction of two logarithms is equivalent to first performing this operation on the two arguments of the logarithms. A (*) "synthetic" version of this operation can be used on polynomials, but this operation is not defined if the second operand is zero. Its result is called a quotient. For 10 points, name this operation, the inverse of multiplication.
An algorithm named for Euclid can be used to find the GCD, or to perform this operation on integers.
division (accept long division; accept answers mentioning greatest common denominator or greatest common factor or GCD or GCF or highest common denominator or highest common factor before "GCD")