Mathématiques

Calculatrice de PPCM et PGCD

Trouvez le Plus Petit Commun Multiple et le Plus Grand Commun Diviseur

Comment Utiliser
  1. Type a list of integers separated by commas or spaces into the box above.
  2. Results update instantly — no button press needed.
  3. The PPCM is the smallest number divisible by all your inputs.
  4. The PGCD (also called HCF) is the largest number that divides all your inputs evenly.

Formule

GCD(a, b) Euclidean algorithm: divide repeatedly until remainder = 0
LCM(a, b) = |a × b| / GCD(a, b)
LCM(a,b,c) = LCM(LCM(a,b), c) — applied iteratively