GCF calculator
Find the largest positive divisor shared by two integers.
Formula
GCF(a,b) = GCF(b, a mod b); repeat until the remainder is 0.
First integer = 24 · Second integer = 36
How to use
- Enter the first positive integer.
- Enter the second positive integer.
- Read the GCF.
Examples
- GCF(24, 36) = 12.
- GCF(18, 30) = 6.
Frequently asked questions
Are negative or decimal inputs accepted?
No. This tool uses positive whole numbers.
How does GCF simplify a fraction?
Divide the numerator and denominator by their GCF.
What is the limit?
Each integer must be at most 1000000000000.
Sources
Updated: