Greatest Common Divisor (GCD) of 62 and 105
The greatest common divisor (GCD) of 62 and 105 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 62 and 105?
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 ÷ 105 = 0 remainder 62 |
| 2 | 105 ÷ 62 = 1 remainder 43 |
| 3 | 62 ÷ 43 = 1 remainder 19 |
| 4 | 43 ÷ 19 = 2 remainder 5 |
| 5 | 19 ÷ 5 = 3 remainder 4 |
| 6 | 5 ÷ 4 = 1 remainder 1 |
| 7 | 4 ÷ 1 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 91 and 16 | 1 |
| 98 and 125 | 1 |
| 14 and 73 | 1 |
| 71 and 115 | 1 |
| 157 and 60 | 1 |