Greatest Common Divisor (GCD) of 71 and 93
The greatest common divisor (GCD) of 71 and 93 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 71 and 93?
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 | 71 ÷ 93 = 0 remainder 71 |
| 2 | 93 ÷ 71 = 1 remainder 22 |
| 3 | 71 ÷ 22 = 3 remainder 5 |
| 4 | 22 ÷ 5 = 4 remainder 2 |
| 5 | 5 ÷ 2 = 2 remainder 1 |
| 6 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 20 and 102 | 2 |
| 116 and 29 | 29 |
| 150 and 161 | 1 |
| 196 and 63 | 7 |
| 41 and 155 | 1 |