Greatest Common Divisor (GCD) of 95 and 62
The greatest common divisor (GCD) of 95 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 95 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 | 95 ÷ 62 = 1 remainder 33 |
| 2 | 62 ÷ 33 = 1 remainder 29 |
| 3 | 33 ÷ 29 = 1 remainder 4 |
| 4 | 29 ÷ 4 = 7 remainder 1 |
| 5 | 4 ÷ 1 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 164 and 66 | 2 |
| 173 and 127 | 1 |
| 190 and 112 | 2 |
| 100 and 99 | 1 |
| 168 and 125 | 1 |