Greatest Common Divisor (GCD) of 113 and 63
The greatest common divisor (GCD) of 113 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 113 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 | 113 ÷ 63 = 1 remainder 50 |
| 2 | 63 ÷ 50 = 1 remainder 13 |
| 3 | 50 ÷ 13 = 3 remainder 11 |
| 4 | 13 ÷ 11 = 1 remainder 2 |
| 5 | 11 ÷ 2 = 5 remainder 1 |
| 6 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 180 and 59 | 1 |
| 126 and 174 | 6 |
| 12 and 128 | 4 |
| 139 and 167 | 1 |
| 18 and 181 | 1 |