Greatest Common Divisor (GCD) of 141 and 55
The greatest common divisor (GCD) of 141 and 55 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 141 and 55?
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 | 141 ÷ 55 = 2 remainder 31 |
| 2 | 55 ÷ 31 = 1 remainder 24 |
| 3 | 31 ÷ 24 = 1 remainder 7 |
| 4 | 24 ÷ 7 = 3 remainder 3 |
| 5 | 7 ÷ 3 = 2 remainder 1 |
| 6 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 158 and 31 | 1 |
| 198 and 15 | 3 |
| 131 and 148 | 1 |
| 160 and 135 | 5 |
| 162 and 160 | 2 |