When one of a and b is zero, the GCD is the absolute value of the nonzero integer: gcd (a, 0) = gcd (0, a) = |a|. This case is important as the terminating step of the Euclidean algorithm.
The greatest common factor (GCF or GCD or HCF) of a set of whole numbers is the largest positive integer that divides evenly into all numbers with zero remainder.
The GCD (Greatest Common Divisor), also known as the HCF (Highest Common Factor), is the largest positive integer that divides two or more numbers without leaving a remainder.
The meaning and full form of GCD is the Greatest Common Divisor. So, GCD is the greatest positive number which is a common divisor for a given set of positive numbers.
The greatest common divisor (GCD), also called the greatest common factor, of two numbers is the largest number that divides them both. For instance, the greatest common factor of 20 and 15 is 5, since 5 divides both 20 and 15 and no larger number has this property.
The greatest common divisor GCD (a,b,c,...) can also be defined for three or more positive integers as the largest divisor shared by all of them. Two or more positive integers that have greatest common divisor 1 are said to be relatively prime to one...
The GCD is sometimes called the greatest common factor (GCF). A very useful property of the GCD is that it can be represented as a sum of the given numbers with integer coefficients.
When one of a and b is zero, the GCD is the absolute value of the nonzero integer: gcd (a, 0) = gcd (0, a) = |a|. This case is important as the terminating step of the Euclidean algorithm.