Greatest Common Divisor (GCD) of 35 and 167
The greatest common divisor (GCD) of 35 and 167 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 35 and 167?
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 | 35 ÷ 167 = 0 remainder 35 |
| 2 | 167 ÷ 35 = 4 remainder 27 |
| 3 | 35 ÷ 27 = 1 remainder 8 |
| 4 | 27 ÷ 8 = 3 remainder 3 |
| 5 | 8 ÷ 3 = 2 remainder 2 |
| 6 | 3 ÷ 2 = 1 remainder 1 |
| 7 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 23 and 147 | 1 |
| 165 and 187 | 11 |
| 102 and 200 | 2 |
| 185 and 199 | 1 |
| 123 and 95 | 1 |