Number Theory & Fractions
最小公倍数与最大公约数计算器
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
问答专区
常见问题解答
关于计算公式、数学精度和实际应用的常见疑问。
最小公倍数是能被给定所有整数同时整除的最小正整数;最大公约数是能同时整除给定所有整数的最大正整数。