Greatest Common Divisor (GCD) of 28 and 56
The greatest common divisor (GCD) of 28 and 56 is 28.
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 28 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 | 28 ÷ 56 = 0 remainder 28 |
| 2 | 56 ÷ 28 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 130 and 91 | 13 |
| 195 and 143 | 13 |
| 113 and 49 | 1 |
| 153 and 10 | 1 |
| 51 and 123 | 3 |