# gcd calculation online

## Calculus gcd

Calculus in processing ... please wait

### Function : gcd

#### Summary :

GCD calculator using Euclid's algorithm, and details the steps of GCD calculation.

Gcd online

#### Description :

The GCD function calculates online the greatest common divisor of two integers. To calculate the GCD online , the function uses the Euclidean algorithm .The steps of the GCD calculations are specified.

# Principle of the Euclidean algorithm

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.

# Calculating the GCD

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.

GCD calculator using Euclid's algorithm, and details the steps of GCD calculation.

#### Syntax :

gcd(a;b), a and b are integers.

#### Examples :

gcd(15;25), returns 5

Calculate online with gcd (gcd calculation online)