Greatest Common Divisor (GCD) of 152 and 54
The greatest common divisor (GCD) of 152 and 54 is 2.
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 152 and 54?
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 | 152 ÷ 54 = 2 remainder 44 |
| 2 | 54 ÷ 44 = 1 remainder 10 |
| 3 | 44 ÷ 10 = 4 remainder 4 |
| 4 | 10 ÷ 4 = 2 remainder 2 |
| 5 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 197 and 53 | 1 |
| 106 and 76 | 2 |
| 124 and 133 | 1 |
| 93 and 42 | 3 |
| 156 and 39 | 39 |