| LCM | 720 |
|---|---|
| Prime factorization of 48 | 2⁴ × 3 |
| Prime factorization of 36 | 2² × 3² |
| Prime factorization of 60 | 2² × 3 × 5 |
| Common prime factors | 2² × 3 |
| Euclidean algorithm for 48 and 36 | 48 = 1 × 36 + 12 → 36 = 3 × 12 + 0 → GCF 12 |
| Each number ÷ GCF | 4, 3, 5 |
Euclid's algorithm: divide, keep the remainder, repeat until the remainder is 0 — the last nonzero remainder is the GCF. Then continue with the remaining numbers: GCF(12, 60) = 12. GCF = 12.
GCF Calculator · free calculator by CalcWorthy