Greatest Common Divisor (GCD) of 30 and 60
The greatest common divisor (GCD) of 30 and 60 is 30.
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 30 and 60?
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 | 30 ÷ 60 = 0 remainder 30 |
| 2 | 60 ÷ 30 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 135 and 21 | 3 |
| 61 and 36 | 1 |
| 197 and 168 | 1 |
| 143 and 62 | 1 |
| 50 and 149 | 1 |