Two divisors that differ by a principal divisor are called linearly equivalent. The Euclidean algorithm determines the greatest common divisor (gcd) of two integers, say and . The Euclidean algorithm for computing the greatest common divisor of two integers is one example. The quotient multiplied by the divisor always yields the dividend. This concept is analogous to the greatest common divisor of two integers. An integer formula 56 whose only proper divisor is 1 is called a prime number. This is equivalent to their greatest common divisor (gcd) being 1. In mathematics, division by zero is division where the divisor (denominator) is zero. There are several ways to find the greatest common divisor of two polynomials. Here, "coprime" means that the monic greater common divisor is . Negate the coefficients of the divisor. Division finds the "quotient" of two numbers, the "dividend" divided by the "divisor". Usually the quotient is written under a bar drawn under the divisor. A right zero divisor is defined similarly. Euclid's algorithm for finding the greatest common divisor of two numbers.