GCD Calculator — Formel
## Greatest Common Divisor (GCD)
### Definition
The GCD of two numbers is the largest positive integer that divides both numbers evenly.
### Euclidean Algorithm
1. Divide the larger number by the smaller
2. Replace the larger number with the remainder
3. Repeat until the remainder is 0
4. The last nonzero remainder is the GCD
### Relationship with LCM
**LCM(a, b) = |a × b| / GCD(a, b)**
### Definition
The GCD of two numbers is the largest positive integer that divides both numbers evenly.
### Euclidean Algorithm
1. Divide the larger number by the smaller
2. Replace the larger number with the remainder
3. Repeat until the remainder is 0
4. The last nonzero remainder is the GCD
### Relationship with LCM
**LCM(a, b) = |a × b| / GCD(a, b)**
Lösungsbeispiel
Find GCD(48, 36).
- 48 = 1 × 36 + 12
- 36 = 3 × 12 + 0
- GCD = 12
- LCM = (48 × 36) / 12 = 144