GCD・LCM計算機
2つの数の最大公約数（GCD）と最小公倍数（LCM）を計算します。
GCD (Greatest Common Divisor)
LCM (Least Common Multiple)
How to use
- Enter two positive integers in the input fields.
- Click Calculate to instantly get both the GCD and LCM.
- The GCD is the largest integer that divides both numbers evenly. The LCM is the smallest positive integer divisible by both.
Related math tools
- Fraction Calculator — uses GCD internally to simplify fractions
- Prime Factorization — decompose integers into prime factors
- Prime Number Checker — test if a number is prime
よくある質問
- Is this GCD and LCM calculator free?
- Yes, completely free with no signup and no usage limits.
- Does my data leave my device?
- No. The Euclidean algorithm runs entirely in your browser. No data is sent anywhere.
- Does it work on mobile?
- Yes. Works on iPhone Safari and Android Chrome without installing any app.
Last updated: By jarvisbox