Common factors of a set of integers are the positive integers that divide all numbers in the set.
GCD is the largest common factor. We first compute the GCD, then list every divisor of the GCD.
Input format: integers only (comma/space/newline separated). Negatives are allowed; absolute values are used. Zeros are allowed, but if all inputs are 0, the result is undefined.
Prime factorization shown for the GCD and each input helps verify results (e.g., 84 = 22 × 3 × 7).
Why GCD first? Because common factors of the whole set are exactly the positive divisors of the GCD.
Edge cases & notes
If at least one value is non-zero, gcd(0, a) = |a|. If all are 0, common factors are undefined.
Order doesn’t matter; whitespace and commas are both fine.
Performance scales to hundreds of integers quickly via the Euclidean algorithm.
Cookies & privacy
Utilities Bunker uses necessary cookies to run the site. Optional cookies help remember preferences,
measure usage, and improve the platform. You can change your choices any time.
Privacy Policy.
