For example, the greatest common factor of 15 and 10 is 5, since both the numbers can be divided by 5. If a and b are two numbers then the greatest common divisor of both the numbers is denoted by gcd (a, b).
How to find the greatest common divisor ( GCD )?
From the factorisation, we can see, only 2 x 3 are common prime factors. In this method, the largest number among the given set of numbers should be divided by the second largest number, and again the second-largest number should be divided by the remainder of the previous operation, this process will continue till the remainder is zero.
How to find the greatest divisor of a set of numbers?
The GCD calculator allows you to quickly find the greatest common divisor of a set of numbers. You may enter between two and ten non-zero integers between -2147483648 and 2147483647. The numbers must be separated by commas, spaces or tabs or may be entered on separate lines.
How is the greatest common divisor used in real life?
The concept of the greatest common divisor or the highest common factor is used in many real-life incidents as below. A shopkeeper has 420 balls and 130 bats to pack in a day. She wants to pack them in such a way that each set has the same number in a box, and they take up the least area of the box.
Which is more efficient GCD of two numbers?
An efficient solution is to use Euclidean algorithm which is the main algorithm used for this purpose. The idea is, GCD of two numbers doesn’t change if smaller number is subtracted from a bigger number. A more efficient solution is to use modulo operator in Euclidean algorithm .
Which is the greatest common factor of two numbers?
Greatest common divisor The greatest common divisor (GCD) of two or more numbers is the greatest common factor number that divides them, exactly. It is also called the highest common factor (HCF). For example, the greatest common factor of 15 and 10 is 5, since both the numbers can be divided by 5.
