حاسبة القاسم المشترك الأكبر والمضاعف المشترك الأصغر.

Up to 50 numbers. GCD and LCM work on very large integers; factorisation is limited to numbers up to 10¹⁸. Everything is calculated in your browser; nothing you type is uploaded.

GCD uses Euclid’s algorithm on exact integers; LCM(a, b) = a × b ÷ GCD(a, b), applied across the list.

84, 126 and 210 have a GCD of 42 and an LCM of 1,260; 84 = 2² × 3 × 7.