Contents
- ๐ What is this?
- ๐จ๐ปโ๐ป How to use it?
- ๐ฐ Examples
- ๐ Nuances
- ๐ค Frequently asked questions
- ๐ Related materials
How the GCD calculator works
Enter two integers. The calculator finds their greatest common divisor and can reveal every division in the Euclidean algorithm.
Finding the largest shared factor
The GCD is the largest positive integer that divides both numbers without a remainder. Signs do not affect divisibility, so the calculation uses the absolute values of the inputs.
Each pass replaces the larger pair with the divisor and remainder. When the remainder reaches zero, the last nonzero divisor is the answer.
- Enter whole numbers in both fields.
- Read the prominent GCD and the two reduced quotients.
- Open the Euclidean algorithm when you want to audit the arithmetic.
Useful examples
48 and 18 give 6. They can be divided into six equal groups containing 8 and 3 items respectively.
84 and 126 give 42. The same result reduces the fraction 84/126 to 2/3.
17 and 31 give 1. A GCD of one means the numbers are coprime.
-54 and 24 give 6. The minus sign is ignored for the purpose of finding divisors.
Zero, large integers and interpretation
- The GCD of 0 and a nonzero integer is the absolute value of that integer.
- There is no greatest positive common divisor of 0 and 0; this calculator displays 0 as a practical computing convention.
- Composite numbers can still be coprime: 8 and 15 have GCD 1.
- Inputs may contain up to 100 digits, but decimal fractions and exponent notation are not accepted.
A GCD describes shared divisibility, not whether either input is prime.
Questions about greatest common divisors
What does a GCD of 1 mean?
The two integers are coprime: they share no positive divisor larger than one.
Can I enter negative integers?
Yes. The calculator uses absolute values, so changing a sign does not change the GCD.
Why is GCD(0, 25) equal to 25?
Every positive divisor of 25 also divides zero, so 25 is the greatest common divisor of the pair.
Is GCD(0, 0) really zero?
Mathematically the usual greatest positive divisor is not defined for this pair. The displayed zero is an explicit computing convention.
How does the GCD reduce a fraction?
Divide the numerator and denominator by their GCD. For 84/126, division by 42 gives 2/3.
Does the calculator round large values?
No. It uses exact integer arithmetic for inputs up to 100 digits.
Similar calculators
You may find the following calculators on the same topic useful:
- Least common multiple calculator. Enter two integers with up to 100 digits each to find their exact least common multiple.
- Z-score calculator. Compare a value with its group mean or recover the original value from a known Z-score.
- Megabits to megabytes converter. Enter a value in Mb or MB and see the equivalent data quantity immediately.
- Standard deviation calculator. Paste a numerical list, choose population or sample, and control the displayed precision without rounding the internal result.
- Mean, median and mode calculator. Paste a list of numbers to compare its mean, median, mode, range and endpoints.
- Quartile and interquartile range calculator. Paste a number list to measure its central half and identify observations beyond the inner fences.
- Time converter. Enter a duration and convert it instantly between common short, everyday, and average calendar units.
- Geometric mean calculator. Enter positive values to find their representative multiplicative factor.
- Harmonic mean calculator. Enter positive rates or ratios to see their harmonic mean.
- Arrangements and permutations calculator. Choose how many distinct elements to arrange and get every digit of the answer.
Share on social media
If you liked it, please share the calculator on your social media platforms. It`s easy for you and beneficial for the project`s promotion. Thank you!