Numbers
Greatest Common Divisor Calculator
Used by developers, writers, and creators worldwide.
A greatest common divisor calculator finds the largest whole number that divides two numbers without leaving a remainder. Enter two numbers and it computes the GCD with the Euclidean algorithm, the classic method that repeatedly replaces the larger number with the remainder until nothing is left over. It shows the GCD, the ratio of the inputs reduced to lowest terms, the first Euclidean step so you can follow the logic, and the matching least common multiple for completeness. The GCD is the key to simplifying fractions, reducing ratios, and tiling or grouping problems where you need the biggest even split. Students use it to reduce fractions, teachers to demonstrate Euclid's method, and anyone working with proportions to express them cleanly. Because the Euclidean algorithm is extremely efficient, the tool handles large inputs instantly. Use it to simplify a fraction, reduce a ratio, or learn how Euclid's ancient method actually works.
Read the complete guide — 4 min read
Loading usage…
Free forever — no account required
How to use
- Choose your options above
- Click Generate
- Copy your result
Detailed instructions
- Enter the first whole number.
- Enter the second whole number.
- Click Generate to compute the GCD.
- Read the reduced ratio and the Euclidean step.
Use Cases
- •Reducing a fraction to its simplest form
- •Simplifying a ratio to lowest terms
- •Finding the biggest equal grouping of two amounts
- •Demonstrating the Euclidean algorithm in class
- •Computing the GCD needed for an LCM
Tips
- →Divide a fraction by the GCD to get lowest terms.
- →A GCD of one means the numbers are coprime.
- →The Euclidean method stays fast even for huge inputs.
- →GCD and LCM together describe how two numbers relate.
FAQ
what is the Euclidean algorithm
It finds the GCD by repeatedly dividing the larger number by the smaller and keeping the remainder, then repeating with the smaller number and that remainder until the remainder is zero. The last nonzero divisor is the GCD.
how does the GCD reduce a fraction
Dividing both the numerator and denominator of a fraction by their GCD gives the fraction in lowest terms. The reduced ratio line shows exactly that simplification for the two numbers you entered.
what if the numbers share no common factor
If the only number dividing both is one, the GCD is one and the numbers are called coprime. Their ratio is already in lowest terms and cannot be reduced any further.
You might also like
Popular tools from other categories that share themes with this one.