Greatest Common Divisor (GCD) of 60 and 35
The greatest common divisor (GCD) of 60 and 35 is 5.
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 35?
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 ÷ 35 = 1 remainder 25 |
| 2 | 35 ÷ 25 = 1 remainder 10 |
| 3 | 25 ÷ 10 = 2 remainder 5 |
| 4 | 10 ÷ 5 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 158 and 45 | 1 |
| 34 and 27 | 1 |
| 124 and 89 | 1 |
| 147 and 98 | 49 |
| 185 and 191 | 1 |