- Calculators
- ::
- Numbers
- ::
- GCD Calculator

**The greatest common division calculator computes GCD of two or more integers.**
Calculator implements four different computation methods:
prime factorization, repeated division, Euclidean algorithm and listing out the factors.

working...

Examples

ex 1:

What is the Greatest Common Divisor (GCD) of 104 and 64?

ex 2:

Find GCD of 96, 144 and 192 using a repeated division.

ex 3:

Find GCD of 54 and 60 using an Euclidean Algorithm.

ex 4:

Find GCD of 72 and 54 by listing out the factors.

Related calculators

Find more worked-out examples in our database of solved problems..

The greatest common divisor (multiple) of two integers is the largest number that divides them both. This calculator provides four methods to compute GCD. We'll show them with a few examples.

Example: find GCD of 36 and 48

Step 1: find prime factorization of each number:

42 = 2 * 3 * 7

70 = 2 * 5 * 7

Step 2: circle out all common factors:

42 = ② * 3 * ⑦

70 = ② * 5 * ⑦

We see that the GCD is ② * ⑦ = **14**

Example: find GCD of 84 and 140.

Step 1: Place the numbers inside division bar:

84 | 140 |

Step 2: Divide both numbers by 2:

2 |
84 | 140 |

42 |
70 |

Step 3: Continue to divide until the numbers do not have a common factor.

② | 84 | 140 |

② | 42 | 70 |

⑦ | 21 | 35 |

3 | 7 |

Step 4: The GCD of 84 and 140 is:
② * ② * ⑦ = **28**

Example: Find GCD of 52 and 36, using Euclidean algorithm.

Solution: Divide 52 by 36 and get the remainder, then divide 36 with the remainder from previous step. When the remainder is zero the GCD is the last divisor.

52 | : | 36 | = | 1 | remainder (16) | ||||

36 | : | 16 | = | 1 | remainder (4) | ||||

16 | : | ④ | = | 4 | remainder (0) |

We conclude that the GCD = 4.

Example: find GCD of 45 and 54 by listing out the factors.

Step 1: Find divisors for the given numbers:

The divisors of 45 are 1, 3, 5, ⑨, 15 and 45

The divisors of 54 are 1, 2, 3, 6, ⑨ 18, 27 and 54

Step 2: The greatest divisor = ⑨

RESOURCES

1. GCD Definition, Methods, Examples

2. Euclidean Algorithm - video tutorial

3. Program to Find GCD - code implementation in C++, C, Java, Python, C# and Javascript.

Search our database with more than 300 calculators

443 637 131 solved problems

×

ans:

syntax error

C

DEL

ANS

±

(

)

÷

×

7

8

9

–

4

5

6

+

1

2

3

=

0

.