Compute the GCF (GCD) across any list of positive integers.
Yes — Greatest Common Factor and Greatest Common Divisor are two names for the same value: the largest positive integer that divides all the given numbers evenly.
The calculator finds the GCD of the first two numbers using the Euclidean algorithm, then finds the GCD of that result with the next number, repeating down the list — this gives the correct GCF for any number of values.
It shows each number broken into its prime factors. The GCF is the product of the primes common to every number, each raised to the lowest power it appears with — the listed factorizations make that overlap easy to spot.