Greatest Common Divisor (GCD) of 136 and 150
The greatest common divisor (GCD) of 136 and 150 is 2.
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 136 and 150?
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 | 136 ÷ 150 = 0 remainder 136 |
| 2 | 150 ÷ 136 = 1 remainder 14 |
| 3 | 136 ÷ 14 = 9 remainder 10 |
| 4 | 14 ÷ 10 = 1 remainder 4 |
| 5 | 10 ÷ 4 = 2 remainder 2 |
| 6 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 160 and 142 | 2 |
| 170 and 10 | 10 |
| 102 and 57 | 3 |
| 65 and 107 | 1 |
| 95 and 46 | 1 |