Greatest Common Divisor (GCD) of 141 and 102
The greatest common divisor (GCD) of 141 and 102 is 3.
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 102?
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 ÷ 102 = 1 remainder 39 |
| 2 | 102 ÷ 39 = 2 remainder 24 |
| 3 | 39 ÷ 24 = 1 remainder 15 |
| 4 | 24 ÷ 15 = 1 remainder 9 |
| 5 | 15 ÷ 9 = 1 remainder 6 |
| 6 | 9 ÷ 6 = 1 remainder 3 |
| 7 | 6 ÷ 3 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 146 and 144 | 2 |
| 180 and 156 | 12 |
| 137 and 57 | 1 |
| 113 and 186 | 1 |
| 171 and 38 | 19 |