Greatest Common Divisor (GCD) of 36 and 145
The greatest common divisor (GCD) of 36 and 145 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 36 and 145?
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 | 36 ÷ 145 = 0 remainder 36 |
| 2 | 145 ÷ 36 = 4 remainder 1 |
| 3 | 36 ÷ 1 = 36 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 198 and 93 | 3 |
| 166 and 159 | 1 |
| 189 and 136 | 1 |
| 20 and 102 | 2 |
| 72 and 57 | 3 |