GCD calculator that uses Euclid's algorithm to give the steps of the GCD calculation.

gcd online

In arithmetic, the largest divisor that two integers have in common is called the **GCD (Greatest Common Divisor)** or the
**GCF (Greatest Common Factor)**.

The **GCD calculator** allows to calculate online the largest common divisor of two integers.
To calculate the **GCD online** of two integers, the calculator uses **Euclid's algorithm**.
The steps for calculating the GCD are specified.

Thus, for **calculating** the **online gcd** of two integers 150 and 350 , just type
gcd(`150;350`) ,
the calculator returns the result 50.

The **calculation of the GCD** is particularly useful for
simplifying a fraction
and put in the form of an
irreducible fraction.

The Euclidean algorithm uses successive Euclidean division to determine the GCD. To calculate the greatest common divisor of two integers a and b, using the algorithm is performed the Euclidean division of a by b , we obtain a = bq + r. If r is zero, q is the GCD , otherwise it repeats the operation by performing the Euclidean division of b and r .The algorithm uses the following property gcd (a,b)= gcd(b,r). The GCD is the last non-zero remainder . The following example shows a detailed calculation using the algorithm of Euclide to determine the GCD of two numbers.

GCD calculator that uses Euclid's algorithm to give the steps of the GCD calculation.

See also

- Countdown maths solver : arithmetic_solver. This solver allows finding a target number from a set of integer in using arithmetic operations.
- Arrangement : arrangement. To calculate online the number of arrangement of p elements of a set of n elements.
- Base-n converter : base_converter. The calculator allows you to make decimal, binary, hexadecimal conversions, and more generally to any base n between 2 and 36.
- Calculation of binomial coefficients : binomial_coefficient. A binomial coefficient calculator that allows you to calculate a binomial coefficient from two integers.
- To count the number of combinations : combination. To calculate the number of k elements of part of a set of n elements.
- Euclidean division : euclidean_division. The euclidean_division function to calculate online the quotient and the remainder in the euclidean division of two polynomials or two integers.
- Factorial : factorial. Online factorial Calculator. The factorial of a natural number n is the product of the positive integers less than or equal to n.
- Gcd calculation online : gcd. GCD calculator that uses Euclid's algorithm to give the steps of the GCD calculation.
- Parity of a number : is_even. Is_even function returns 1 if the number is even, 0 otherwise.
- Parity of a number : is_odd. Is_odd function returns true if the number passed is odd, false otherwise.
- Least common multiple : lcm. LCM calculator to calculate the least common multiple (LCM).
- Permutation : permutation. To calculate online the number of permutation of a set of n elements.
- Prime factorization calculator : prime_factorization. The function prime_factorization is used to calculate online the decomposition of an integer into prime factors.
- Pythagorean theorem : pythagorean. The function makes it possible to verify by using the Pythagorean theorem knowing the lengths of the sides of a triangle that this is a right triangle. If the sides of the triangle depend on a variable, then the value of the variable is calculated so that the triangle is a right triangle.