A familiar situation
List every shared divisor when comparing two counts of objects or simplifying ratios.
How to use this calculator
- Enter first integer, second integer.
- Select Calculate to see the answer and its breakdown.
- Keep a scenario, change an input and compare the results.
Use consistent units and check the assumptions below before applying the result.
How common factor is calculated
The shared factors are the positive divisors of gcd(|a|,|b|). Euclid’s algorithm finds the gcd, after which its divisor pairs enumerate the common set. For 18 and 24, the common factors are 1, 2, 3, and 6; the greatest is 6.
Common factors of a and b are exactly the positive divisors of gcd(|a|,|b|).For 18 and 24, the common factors are 1, 2, 3, and 6; the greatest is 6.
Assumptions & useful context
The result depends on the values you enter and the method described above. Displayed numbers may be rounded; calculations use the unrounded values. Check that this model matches your situation before relying on it.
Frequently asked questions
Can values be negative?
Yes; divisibility uses absolute values.
Can both values be zero?
No; that would produce an unbounded set of common divisors.