Greatest Common Divisor (GCD) of 145 and 108
The greatest common divisor (GCD) of 145 and 108 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 145 and 108?
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 | 145 ÷ 108 = 1 remainder 37 |
| 2 | 108 ÷ 37 = 2 remainder 34 |
| 3 | 37 ÷ 34 = 1 remainder 3 |
| 4 | 34 ÷ 3 = 11 remainder 1 |
| 5 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 106 and 170 | 2 |
| 150 and 190 | 10 |
| 120 and 161 | 1 |
| 106 and 123 | 1 |
| 145 and 118 | 1 |