Greatest Common Divisor (GCD) of 15 and 36
The greatest common divisor (GCD) of 15 and 36 is 3.
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 15 and 36?
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 | 15 ÷ 36 = 0 remainder 15 |
| 2 | 36 ÷ 15 = 2 remainder 6 |
| 3 | 15 ÷ 6 = 2 remainder 3 |
| 4 | 6 ÷ 3 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 76 and 59 | 1 |
| 147 and 67 | 1 |
| 175 and 136 | 1 |
| 103 and 21 | 1 |
| 148 and 147 | 1 |