Greatest Common Divisor (GCD) of 95 and 132
The greatest common divisor (GCD) of 95 and 132 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 132?
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 ÷ 132 = 0 remainder 95 |
| 2 | 132 ÷ 95 = 1 remainder 37 |
| 3 | 95 ÷ 37 = 2 remainder 21 |
| 4 | 37 ÷ 21 = 1 remainder 16 |
| 5 | 21 ÷ 16 = 1 remainder 5 |
| 6 | 16 ÷ 5 = 3 remainder 1 |
| 7 | 5 ÷ 1 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 74 and 172 | 2 |
| 63 and 139 | 1 |
| 31 and 22 | 1 |
| 175 and 176 | 1 |
| 160 and 35 | 5 |