Power Calculators

🔗 Common Divisor Checker

Check whether a chosen integer is a common divisor of two numbers.

No ratings yet — be the first
Rate it: ★ ★ ★ ★ ★

Enter details

Fill in the details and click Calculate to see your results.


Also available in our Android app, with charts and full breakdown tables.

📘 About the Common Divisor

This is useful for checking whether a proposed number is shared as a divisor of two integers.

It does not attempt to find the GCD because the current calculator engine has no iterative GCD function.

🧮 Formula

First divisibility test
a mod d = 0
Second divisibility test
b mod d = 0

Where

  • a = first number
  • b = second number
  • d = candidate divisor
The candidate divisor must be non-zero.

✏️ Worked example

Is 12 a common divisor of 48 and 72?

You enter
First Number48
Second Number72
Candidate Divisor12
You get
Common Divisor1
Remainder for First Number0
Remainder for Second Number0

Yes. Both 48 and 72 divide exactly by 12.

Try this example →

🧭 How to use this calculator

What you enter

  • First Number
  • Second Number
  • Candidate Divisor

What you get

  • Common Divisor
  • Remainder for First Number
  • Remainder for Second Number

💡 Important distinction

  • A common divisor divides both numbers.
  • The greatest common divisor is the largest common divisor.
  • This calculator checks the candidate you enter.

❓ Frequently asked questions

Does this find the GCD?

No. It checks whether your chosen divisor divides both numbers.

Can I enter 1?

Yes. 1 is a divisor of every integer.

Can the candidate be zero?

No. Division by zero is undefined.