Greatest Common Divisor (GCD) of 36 and 59
The greatest common divisor (GCD) of 36 and 59 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 36 and 59?
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 ÷ 59 = 0 remainder 36 |
| 2 | 59 ÷ 36 = 1 remainder 23 |
| 3 | 36 ÷ 23 = 1 remainder 13 |
| 4 | 23 ÷ 13 = 1 remainder 10 |
| 5 | 13 ÷ 10 = 1 remainder 3 |
| 6 | 10 ÷ 3 = 3 remainder 1 |
| 7 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 187 and 16 | 1 |
| 12 and 36 | 12 |
| 161 and 188 | 1 |
| 124 and 75 | 1 |
| 176 and 177 | 1 |