Greatest Common Divisor (GCD) of 145 and 63
The greatest common divisor (GCD) of 145 and 63 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 63?
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 ÷ 63 = 2 remainder 19 |
| 2 | 63 ÷ 19 = 3 remainder 6 |
| 3 | 19 ÷ 6 = 3 remainder 1 |
| 4 | 6 ÷ 1 = 6 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 132 and 57 | 3 |
| 179 and 72 | 1 |
| 175 and 154 | 7 |
| 40 and 92 | 4 |
| 172 and 66 | 2 |