Greatest Common Divisor (GCD) of 45 and 136
The greatest common divisor (GCD) of 45 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 45 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 | 45 ÷ 136 = 0 remainder 45 |
| 2 | 136 ÷ 45 = 3 remainder 1 |
| 3 | 45 ÷ 1 = 45 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 168 and 129 | 3 |
| 198 and 27 | 9 |
| 91 and 52 | 13 |
| 133 and 141 | 1 |
| 143 and 10 | 1 |