Greatest Common Divisor (GCD) of 111 and 62
The greatest common divisor (GCD) of 111 and 62 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 111 and 62?
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 | 111 ÷ 62 = 1 remainder 49 |
| 2 | 62 ÷ 49 = 1 remainder 13 |
| 3 | 49 ÷ 13 = 3 remainder 10 |
| 4 | 13 ÷ 10 = 1 remainder 3 |
| 5 | 10 ÷ 3 = 3 remainder 1 |
| 6 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 103 and 34 | 1 |
| 124 and 56 | 4 |
| 146 and 101 | 1 |
| 184 and 110 | 2 |
| 37 and 63 | 1 |