Number Theory & Fractions
最小公倍数(LCM)・最大公約数(GCD)計算ツール
Find the Least Common Multiple (LCM) and Greatest Common Factor (GCF/GCD) with prime factorization and Euclidean division steps.
Integer Inputs
Prime Factorization:
24:2^3 × 3
36:2^2 × 3^2
Calculated Results
LCM (Least Common Multiple)
72
Smallest positive integer divisible by all inputs
GCF / GCD (Greatest Factor)
12
Largest positive integer dividing all inputs
Product Formula: LCM(A, B) × GCF(A, B) = A × B (72 × 12 = 864)
Euclidean Algorithm Steps for GCF(24, 36)
36 = 24 × 1 + 12Remainder: 12
24 = 12 × 2 + 0Remainder 0 -> GCF found
質問と回答
よくある質問
計算式、数学的精度、実際の使用法に関する質問。
最小公倍数(LCM)は与えられたすべての整数で割り切れる最小の正の整数です。最大公約数(GCD)はすべての数を余りなく割り切る最大の正の整数です。