Greatest Common Divisor (GCD) of 36 and 56
The greatest common divisor (GCD) of 36 and 56 is 4.
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 36 and 56?
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 | 36 ÷ 56 = 0 remainder 36 |
| 2 | 56 ÷ 36 = 1 remainder 20 |
| 3 | 36 ÷ 20 = 1 remainder 16 |
| 4 | 20 ÷ 16 = 1 remainder 4 |
| 5 | 16 ÷ 4 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 108 and 137 | 1 |
| 160 and 110 | 10 |
| 50 and 170 | 10 |
| 99 and 49 | 1 |
| 195 and 31 | 1 |