I have forgotten

• http://facebook.com/
• https://www.google.com/accounts/o8/id
• https://me.yahoo.com COST (GBP) 0.40 0.00 0

# gcd

viewed 3307 times and licensed 48 times
Compute the greatest common divisor of two values. Excel: GCD
Controller: CodeCogs Contents  C++

## Gcd

 doublegcd( double a double b )
Calculate the greatest common divisor of two values. This function is equivalent to the Microsoft Excel function GCD . One divides every number evenly. If either argument is zero, the other argument is returned.

This function is non-recursive so will not cause stack problems with exremely large values.

### Example 1

```#include <iostream>
#include <codecogs/maths/combinatorics/arithmetic/gcd.h>

int main(int argc, char *argv[])
{
double a=5.0, b=2.0;
std::cout<<"gcd("<<a<<", "<<b<<")="<<Maths::Arithmetic::gcd(a, b)<<std::endl;

a=24.0, b=36.0;
std::cout<<"gcd("<<a<<", "<<b<<")="<<Maths::Arithmetic::gcd(a, b)<<std::endl;

a=7.0, b=1.0;
std::cout<<"gcd("<<a<<", "<<b<<")="<<Maths::Arithmetic::gcd(a, b)<<std::endl;

a=5.0, b=0.0;
std::cout<<"gcd("<<a<<", "<<b<<")="<<Maths::Arithmetic::gcd(a, b)<<std::endl;

return 0;
}```
Output:
```gcd(5, 2)=1
gcd(24, 36)=12
gcd(7, 1)=1
gcd(5, 0)=5```

### Parameters

 a The first value. b The second value.

### Returns

The greatest common divisor of the two values.

### Authors

James Warren (July 2005)
##### Source Code

Source code is available when you agree to a GP Licence or buy a Commercial Licence.

Not a member, then Register with CodeCogs. Already a Member, then Login.