Greatest Common Divisor (GCD) of 63 and 45
The greatest common divisor (GCD) of 63 and 45 is 9.
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 63 and 45?
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 | 63 ÷ 45 = 1 remainder 18 |
| 2 | 45 ÷ 18 = 2 remainder 9 |
| 3 | 18 ÷ 9 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 186 and 112 | 2 |
| 90 and 178 | 2 |
| 187 and 54 | 1 |
| 132 and 125 | 1 |
| 148 and 86 | 2 |