Greatest Common Divisor (GCD) of 101 and 136
The greatest common divisor (GCD) of 101 and 136 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 101 and 136?
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 | 101 ÷ 136 = 0 remainder 101 |
| 2 | 136 ÷ 101 = 1 remainder 35 |
| 3 | 101 ÷ 35 = 2 remainder 31 |
| 4 | 35 ÷ 31 = 1 remainder 4 |
| 5 | 31 ÷ 4 = 7 remainder 3 |
| 6 | 4 ÷ 3 = 1 remainder 1 |
| 7 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 152 and 90 | 2 |
| 143 and 49 | 1 |
| 78 and 100 | 2 |
| 138 and 20 | 2 |
| 141 and 107 | 1 |