Greatest Common Divisor (GCD) of 60 and 59
The greatest common divisor (GCD) of 60 and 59 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 60 and 59?
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 | 60 ÷ 59 = 1 remainder 1 |
| 2 | 59 ÷ 1 = 59 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 101 and 52 | 1 |
| 87 and 97 | 1 |
| 105 and 109 | 1 |
| 120 and 10 | 10 |
| 96 and 190 | 2 |