Example: 30 and 42
Factor them.
2 x 3 x 5 = 30
2 x 3 x 7 = 42
Select the common factors.
2 x 3 = 6, the GCF
Chat with our AI personalities
The greatest common divisor (GCD) of two numbers is the largest positive integer that divides both numbers without a remainder. To find the GCD of 2233 and 25193, you can use the Euclidean algorithm. By repeatedly applying the algorithm, you will find that the GCD of 2233 and 25193 is 59.
You need at least two numbers to find something in common.
The GCD is 38. You can find it with a calculator, using prime factorization with exponents, or using one of the many on-line GCD calculators.You can also list the factors of both numbers and find the largest one that they have in common.
The Greatest Common Divisor (GCD) for 504 132 is 12
The GCF is 27.