Math & Education Tools
100% Client-Side LCM calculations execute locally.

LCM Calculator (Least Common Multiple)

Calculate Least Common Multiple using the greatest common divisor product formula

Fractions & Number Theory

Fractions, Primes & Factors Studio

Precision fraction reduction to lowest terms, primality tests, Sieve of Eratosthenes generator, divisor sums, and Euclidean GCD/LCM steps.

Input Integers

Preset Pairs:
Greatest Common Divisor
gcd(144, 84)
12
Least Common Multiple
lcm(144, 84)
1008
= (144 × 84) / 12

Euclidean Division Algorithm Proof

StepDividend (a)Divisor (b)Quotient (q)Remainder (r)
114484160
28460124
36024212
4241220

About LCM Calculator (Least Common Multiple)

Compute the Least Common Multiple (LCM) of two integers. Uses the fundamental relationship LCM(a, b) = (|a × b|) / GCD(a, b) with full step-by-step arithmetic explanations.

Key Capabilities & Features

  • Calculates Least Common Multiple of two numbers
  • Shows GCD connection formula step-by-step
  • Fast computation for large integers
  • Clean mathematical typography

How to Use LCM Calculator (Least Common Multiple)

1

Enter Numbers

Input two positive integers.

2

Calculate LCM

View least common multiple value.

3

Review Formula

Inspect calculation steps using GCD.

Privacy & In-Browser Execution Guarantee

LCM calculations execute locally.

Frequently Asked Questions

How is LCM related to GCD?

For any two positive integers a and b, their product equals the product of their GCD and LCM: a × b = GCD(a, b) × LCM(a, b).