Greatest Common Divisor (GCD) of 73 and 112
The greatest common divisor (GCD) of 73 and 112 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 73 and 112?
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 | 73 ÷ 112 = 0 remainder 73 |
| 2 | 112 ÷ 73 = 1 remainder 39 |
| 3 | 73 ÷ 39 = 1 remainder 34 |
| 4 | 39 ÷ 34 = 1 remainder 5 |
| 5 | 34 ÷ 5 = 6 remainder 4 |
| 6 | 5 ÷ 4 = 1 remainder 1 |
| 7 | 4 ÷ 1 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 104 and 79 | 1 |
| 109 and 59 | 1 |
| 103 and 184 | 1 |
| 132 and 126 | 6 |
| 56 and 145 | 1 |