← All blog posts

GCD and LCM Calculator vs doing it by hand — which is faster?

WhiteUI · A plain-English guide to the GCD and LCM Calculator

Doing GCD and LCM by hand is fine for small numbers, and the GCD and LCM Calculator is faster for awkward ones. The honest answer to “which is faster?” depends on the numbers in front of you.

By hand: the easy cases

Take 60 and 90. Euclid takes two steps: 90 ÷ 60 leaves 30, and 60 ÷ 30 leaves 0, so the GCD is 30 and the LCM is 60 × 90 ÷ 30 = 180. That is quick enough by hand that the calculator saves you almost nothing — except the check line, which catches slips.

90 ÷ 60 = 1 remainder 30
60 ÷ 30 = 2 remainder 0
GCD = 30, LCM = 60 × 90 ÷ 30 = 180

At a glance

Multiples of 60 and 90 meet at 180Multiples of 6060120180Multiples of 9090180180 is the first number on both lists — the LCM.
The multiples of 60 are 60, 120 and 180, and the multiples of 90 are 90 and 180 — 180 is the LCM.

By hand: the awkward cases

Now try 2,345 and 6,789. Euclid takes eight divisions before a remainder hits zero, and each one is a long division with four-digit numbers. The GCD turns out to be 1, so the LCM is the full product, 15,920,205 — a number nobody wants to arrive at by hand. With big numbers, the calculator is quicker and the check line proves the answer.

6,789 ÷ 2,345 = 2 remainder 2,099
2,345 ÷ 2,099 = 1 remainder 246
2,099 ÷ 246 = 8 remainder 131
246 ÷ 131 = 1 remainder 115
131 ÷ 115 = 1 remainder 16
115 ÷ 16 = 7 remainder 3
16 ÷ 3 = 5 remainder 1
3 ÷ 1 = 3 remainder 0
GCD = 1, LCM = 2,345 × 6,789 = 15,920,205

The mistake to avoid

Listing multiples by hand for large numbers. Writing out the multiples of 2,345 until you reach a match takes 6,789 steps in the worst case — nobody does that. Euclid's algorithm is the by-hand method worth knowing; listing multiples is only practical for numbers under about 20.

When to use which

Use Euclid by hand for pairs under 100, where two or three divisions settle it. Use the calculator for anything with three or more digits, for a pair where the GCD is not obvious, and whenever the answer matters enough to check. The fastest route is usually both: work it out by hand, then check it on the calculator.

Euclid or listing factors — which by-hand method wins?

There are two honest ways to find a GCD by hand, and they are not equally quick. Listing factors means writing out every divisor of both numbers and picking the largest one they share. For 84 and 126 that is a long list: 84 alone has 12 divisors, and 126 has 12 of its own. Euclid’s algorithm skips the lists entirely. Divide 126 by 84 and the remainder is 42; divide 84 by 42 and the remainder is 0, so the GCD is 42, and the LCM is 84 × 126 ÷ 42 = 252.

Listing factors is fine for numbers under about 30, where the lists are short and you can hold them in your head. Above that, Euclid wins on every count: two divisions settle 84 and 126, where listing factors takes two dozen numbers and a careful comparison. The calculator is still faster than both, but if you are working by hand, Euclid is the method worth knowing — it is the one that stays quick as the numbers grow.

What to check before you trust the answer

Run the same three checks on 84 and 126. First, the product check: 42 × 252 = 10,584, and 84 × 126 = 10,584, so the pair agrees. Second, the GCD must divide both numbers exactly: 84 ÷ 42 = 2 and 126 ÷ 42 = 3. Third, the LCM must be a multiple of both numbers: 252 ÷ 84 = 3 and 252 ÷ 126 = 2.

These checks are worth more by hand than on the calculator, because a by-hand slip usually shows up in only one of the two answers. If the product check fails, do not rework both answers — rework the Euclid steps, since a wrong GCD makes the LCM wrong too. One correct GCD, fed into the LCM formula, fixes both.

Frequently asked questions

Is doing it by hand ever faster?

Yes, for small pairs: 60 and 90 take two Euclid steps by hand, and the GCD is 30.

What is the GCD of 2,345 and 6,789?

1. Euclid takes eight divisions to show they share no divisor except 1.

What is the LCM of 2,345 and 6,789?

15,920,205. Because the GCD is 1, the LCM is the full product of the two numbers.

Should I list multiples to find the LCM?

Only for small numbers. Listing multiples of 2,345 would take thousands of steps, while Euclid takes eight divisions.

More guides on the GCD and LCM Calculator

Try it yourself

Find the GCD and LCM of any two whole numbers — free, in your browser.

Open the GCD and LCM Calculator