GCD & LCM Calculator

Two numbers, two questions

The GCD asks "what is the biggest number that divides both of these?" and the LCM asks "what is the smallest number both numbers divide into?" They are mirror problems on the same pair, and the arithmetic identity between them — LCM = a × b ÷ GCD — is what keeps both honest: for 24 and 36, GCD 12 and LCM 72 satisfy 24 × 36 ÷ 12 = 72 exactly. This page runs the Euclidean algorithm on the pair, the two-thousand-year-old shortcut that finds the GCD with a chain of remainders and needs no factoring at all.

The pair's usefulness is practical more than decorative. Simplifying 36/24 to lowest terms needs the GCD: divide top and bottom by 12 and you get 3/2, reduced in one move. Finding when two repeating schedules coincide needs the LCM: a 24-day cycle and a 36-day cycle land together every 72 days and never sooner. Fractions in a denominators discussion need both at once — and the cute fact that LCM of denominators can be smaller than their product only when they share a common factor, which is exactly the GCD's territory.

A worked example, step by step

Problem: a café restocks milk every 24 days and candles every 36 days; both arrived on the same date. When do they next coincide, and are the cycles shareable for a single combined order cycle?

1. GCD first: 36 = 1 × 24 + 12, and 24 = 2 × 12 + 0. The last non-zero remainder is 12.
2. GCD(24, 36) = 12, so the two cycles are far from coprime — they repeat a lot of ground in common.
3. LCM: 24 × 36 ÷ 12 = 864 ÷ 12 = 72. Both schedules land together every 72 days.
4. Simplify the ratio 24 : 36 by the GCD: 24 ÷ 12 = 2 and 36 ÷ 12 = 3, so the ratio is 2 : 3.
5. Check with the identity: 24 × 36 ÷ 12 = 72 ✓.

The café's answer is "every 72 days" — but the deeper read is that GCD 12 says each cycle splits into 3 and 4 equal phases, so a 12-day pedal point underlies both. If a third delivery cycle showed up, its GCD with 72 would govern whether the trio ever aligns at all.

Common pairs at a glance

The coprime rows are the boundary case worth internalising: when the GCD is 1, the LCM is simply the product, nothing collapses, and no simplification is possible — the pair carries no common structure at all.

Where each one shows up

Simplifying fractions is the textbook use, and the one you will perform most: reduce by the GCD before any other operation so the arithmetic stays small. Building a common denominator for 1/24 + 1/36 uses the LCM — 72, because 24 × 3 = 72 and 36 × 2 = 72 — so the sum is 3/72 + 2/72 = 5/72. Syncing recurring events (restocks, maintenance intervals, round-robin duty rosters) asks the LCM of the cycle lengths. Cropping images or patterns from a grid uses the GCD of the dimensions to find the largest tile that tiles both sides exactly. None of these requires touching a factoring tool first; the Euclidean loop on this page finishes both answers in the same breath.

Mistakes that quietly wrong a GCD or LCM

• Entering decimals or zeros. The tool rejects them for good reason: Euclid's algorithm only terminates exactly on positive integers.
• Assuming the LCM equals the product. That is only true for coprime pairs; 24 × 36 = 864 is safe for neither fraction nor scheduling use.
• Simplifying twice. After dividing by the GCD once, the numerator and denominator are coprime — a second "reduction" finds GCD 1 and changes nothing.
• Swapping the roles. GCD answers "what divides both"; LCM answers "what both divide". Reading 72 as a divisor of 24 is the fastest way to nonsense.
• Forgetting the overflow guard. Very large pairs can produce an LCM above safe integer size; the tool refuses those rather than returning a silent approximation.

Keep exploring

• Ratio Simplifier — simplify a two-part ratio, which is the GCD wearing nicer clothes.
• Average Calculator — the centre of a list, once cycles and fractions are side-tracked.
• Percentage Calculator — shares and slices after reduction, where reduced ratios earn their keep.
• Guide: How to Calculate Percentages.