Greatest Common Divisor (GCD) of 147 and 85
The greatest common divisor (GCD) of 147 and 85 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 147 and 85?
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 | 147 ÷ 85 = 1 remainder 62 |
| 2 | 85 ÷ 62 = 1 remainder 23 |
| 3 | 62 ÷ 23 = 2 remainder 16 |
| 4 | 23 ÷ 16 = 1 remainder 7 |
| 5 | 16 ÷ 7 = 2 remainder 2 |
| 6 | 7 ÷ 2 = 3 remainder 1 |
| 7 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 106 and 176 | 2 |
| 120 and 72 | 24 |
| 100 and 87 | 1 |
| 59 and 30 | 1 |
| 107 and 20 | 1 |