Greatest Common Divisor (GCD) of 145 and 87
The greatest common divisor (GCD) of 145 and 87 is 29.
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 87?
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 ÷ 87 = 1 remainder 58 |
| 2 | 87 ÷ 58 = 1 remainder 29 |
| 3 | 58 ÷ 29 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 14 and 127 | 1 |
| 17 and 186 | 1 |
| 141 and 114 | 3 |
| 122 and 141 | 1 |
| 53 and 175 | 1 |