Enter 2 to 5 whole numbers separated by commas and the calculator returns the GCD, the LCM and each intermediate step.
GCD is the largest number that divides all inputs; LCM is the smallest number they all divide into.
The GCD uses the Euclidean algorithm; the LCM uses the identity LCM(a,b) = |a×b| / GCD(a,b), applied across all numbers.
Between 2 and 5 numbers, separated by commas or spaces.