Greatest Common Divisor (GCD) of 53 and 180
The greatest common divisor (GCD) of 53 and 180 is 1.
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 53 and 180?
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 | 53 ÷ 180 = 0 remainder 53 |
| 2 | 180 ÷ 53 = 3 remainder 21 |
| 3 | 53 ÷ 21 = 2 remainder 11 |
| 4 | 21 ÷ 11 = 1 remainder 10 |
| 5 | 11 ÷ 10 = 1 remainder 1 |
| 6 | 10 ÷ 1 = 10 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 96 and 100 | 4 |
| 49 and 101 | 1 |
| 118 and 11 | 1 |
| 64 and 104 | 8 |
| 140 and 56 | 28 |