Greatest Common Divisor (GCD) of 52 and 13
The greatest common divisor (GCD) of 52 and 13 is 13.
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 52 and 13?
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 | 52 ÷ 13 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 14 and 169 | 1 |
| 151 and 31 | 1 |
| 91 and 149 | 1 |
| 96 and 170 | 2 |
| 145 and 115 | 5 |