Greatest Common Divisor (GCD) of 90 and 32
The greatest common divisor (GCD) of 90 and 32 is 2.
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 90 and 32?
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 | 90 ÷ 32 = 2 remainder 26 |
| 2 | 32 ÷ 26 = 1 remainder 6 |
| 3 | 26 ÷ 6 = 4 remainder 2 |
| 4 | 6 ÷ 2 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 60 and 191 | 1 |
| 11 and 80 | 1 |
| 183 and 112 | 1 |
| 168 and 67 | 1 |
| 151 and 37 | 1 |