Gcd Lcm Calculator
Gcd Lcm Calculator - Free online tool
Enter Numbers
Add two or more integers (non-zero).
Examples:
Results
GCD / HCF
6
Greatest Common Divisor
LCM / LCM
36
Least Common Multiple
Prime Factorization
| Number | Factors |
|---|---|
| 12 | 2^2 × 3 |
| 18 | 2 × 3^2 |
| GCD = 6 | 2 × 3 |
Step-by-Step (Euclidean Algorithm)
| Step | Division |
|---|---|
| 1 | 12 = 18 × 0 + 12 |
| 2 | 18 = 12 × 1 + 6 |
| 3 | 12 = 6 × 2 + 0 |
| → | GCD = 6 |
The Euclidean algorithm repeatedly divides until the remainder is 0. The last non-zero remainder is the GCD.
What are GCD and LCM?
GCD (Greatest Common Divisor) — the largest integer that divides all input numbers without a remainder.
LCM (Least Common Multiple) — the smallest positive integer that is divisible by all input numbers. Useful for adding fractions with different denominators.
LCM(a, b) = |a × b| / GCD(a, b)
Frequently asked questions
What does Gcd Lcm Calculator do?
Gcd Lcm Calculator - Free online tool
What should I check in the result?
Check units, rates, dates and assumptions. Compare a simple case by hand before using the result for a decision.