Step 1: How to use this calculator?

{'step': 1, 'description': 'Apply Euclidean algorithm: ÷ 48 = remainder 12'}

Step 2: How to use this calculator?

{'step': 2, 'description': 'Continue: ÷ 12 = remainder 0'}

Using decimal numbers instead of integers for GCD/LCM

Confusing which is larger (LCM ≥ both numbers, GCD ≤ both numbers)

Calculateur Ppcm Pgcd

Last updated: 2026-08-24

Calculateur Ppcm Pgcd — Calculez GCD via Euclidean algorithm; LCM = (a×b)/GCD(a,b). Exemple: GCD(48, 18) = GCD = 6; LCM = 144. Calculateur gratuit et précis, sans inscription.

Inputs

Result

Enter values and press Calculate

Was this helpful?

How to use it

{'step': 1, 'description': 'Apply Euclidean algorithm: ÷ 48 = remainder 12'}
{'step': 2, 'description': 'Continue: ÷ 12 = remainder 0'}
{'step': 3, 'description': 'GCD = 12 (last non-zero remainder)'}
{'step': 4, 'description': 'LCM = (48 × 60) ÷ 12 = 240'}

Common mistakes

⚠️ Using decimal numbers instead of integers for GCD/LCM
⚠️ Confusing which is larger (LCM ≥ both numbers, GCD ≤ both numbers)
⚠️ Forgetting that GCD is needed to calculete LCM efficiently

Worked example

Find LCM and GCD of and for fraction operations or scheduling problems

The mcm ({mcm}) is the smallest number divisible by both inputs; mcd ({mcd}) is the largest number that divides both inputs evenly.

Input guide

Field	Typical range
num1	Positive integers only; typical: 1-10,000 for practical use
num2	Positive integers only; same range as num1