Greatest Common Divisor (GCD) of 36 and 168
The greatest common divisor (GCD) of 36 and 168 is 12.
What is the Greatest Common Divisor (GCD)?
The GCD of two integers is the largest positive integer that divides both numbers without leaving a remainder. It is useful in simplifying fractions, finding common factors, and in number theory.
How to Calculate the GCD of 36 and 168?
We use the Euclidean algorithm, which involves the following steps:
- Divide the larger number by the smaller number.
- Replace the larger number with the smaller number and the smaller number with the remainder from the division.
- Repeat this process until the remainder is zero.
- The non-zero remainder just before zero is the GCD.
Step-by-Step Euclidean Algorithm
| Step | Calculation |
|---|---|
| 1 | 36 ÷ 168 = 0 remainder 36 |
| 2 | 168 ÷ 36 = 4 remainder 24 |
| 3 | 36 ÷ 24 = 1 remainder 12 |
| 4 | 24 ÷ 12 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 136 and 96 | 8 |
| 10 and 154 | 2 |
| 54 and 107 | 1 |
| 112 and 150 | 2 |
| 95 and 190 | 95 |