Greatest Common Divisor (GCD) of 63 and 101
The greatest common divisor (GCD) of 63 and 101 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 63 and 101?
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 ÷ 101 = 0 remainder 63 |
| 2 | 101 ÷ 63 = 1 remainder 38 |
| 3 | 63 ÷ 38 = 1 remainder 25 |
| 4 | 38 ÷ 25 = 1 remainder 13 |
| 5 | 25 ÷ 13 = 1 remainder 12 |
| 6 | 13 ÷ 12 = 1 remainder 1 |
| 7 | 12 ÷ 1 = 12 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 125 and 62 | 1 |
| 158 and 54 | 2 |
| 188 and 14 | 2 |
| 116 and 149 | 1 |
| 148 and 16 | 4 |