Greatest Common Divisor (GCD) of 145 and 104
The greatest common divisor (GCD) of 145 and 104 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 104?
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 ÷ 104 = 1 remainder 41 |
| 2 | 104 ÷ 41 = 2 remainder 22 |
| 3 | 41 ÷ 22 = 1 remainder 19 |
| 4 | 22 ÷ 19 = 1 remainder 3 |
| 5 | 19 ÷ 3 = 6 remainder 1 |
| 6 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 105 and 58 | 1 |
| 114 and 118 | 2 |
| 127 and 198 | 1 |
| 49 and 100 | 1 |
| 53 and 106 | 53 |