Greatest Common Divisor (GCD) of 36 and 61
The greatest common divisor (GCD) of 36 and 61 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 61?
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 ÷ 61 = 0 remainder 36 |
| 2 | 61 ÷ 36 = 1 remainder 25 |
| 3 | 36 ÷ 25 = 1 remainder 11 |
| 4 | 25 ÷ 11 = 2 remainder 3 |
| 5 | 11 ÷ 3 = 3 remainder 2 |
| 6 | 3 ÷ 2 = 1 remainder 1 |
| 7 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 173 and 88 | 1 |
| 159 and 91 | 1 |
| 130 and 67 | 1 |
| 69 and 65 | 1 |
| 106 and 14 | 2 |