Greatest Common Divisor (GCD) of 62 and 100
The greatest common divisor (GCD) of 62 and 100 is 2.
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 62 and 100?
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 | 62 ÷ 100 = 0 remainder 62 |
| 2 | 100 ÷ 62 = 1 remainder 38 |
| 3 | 62 ÷ 38 = 1 remainder 24 |
| 4 | 38 ÷ 24 = 1 remainder 14 |
| 5 | 24 ÷ 14 = 1 remainder 10 |
| 6 | 14 ÷ 10 = 1 remainder 4 |
| 7 | 10 ÷ 4 = 2 remainder 2 |
| 8 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 54 and 58 | 2 |
| 52 and 159 | 1 |
| 102 and 197 | 1 |
| 200 and 48 | 8 |
| 99 and 19 | 1 |