stdlib-js
<summary>
About stdlib...
</summary>
We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.
The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.
When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.
To join us in bringing numerical computing to the web, get started by checking us out on GitHub, and please consider financially supporting stdlib. We greatly appreciate your continued support!
gcd
[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url]
Compute the [greatest common divisor][gcd] (gcd).
a and b is the largest positive integer which divides both a and b without a remainder. The gcd is also known as the greatest common factor (gcf), highest common factor (hcf), highest common divisor, and greatest common measure (gcm).
bash
npm install @stdlib/math-base-special-gcd
javascript
var gcd = require( '@stdlib/math-base-special-gcd' );
#### gcd( a, b )
Computes the [greatest common divisor][gcd] (gcd).
javascript
var v = gcd( 48, 18 );
// returns 6
If both a and b are 0, the function returns 0.
javascript
var v = gcd( 0, 0 );
// returns 0
Both a and b must have integer values; otherwise, the function returns NaN.
javascript
var v = gcd( 3.14, 18 );
// returns NaN
v = gcd( 48, 3.14 );
// returns NaN
v = gcd( NaN, 18 );
// returns NaN
v = gcd( 48, NaN );
// returns NaN
javascript
var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
var gcd = require( '@stdlib/math-base-special-gcd' );
var a = discreteUniform( 100, 0, 50 );
var b = discreteUniform( a.length, 0, 50 );
var i;
for ( i = 0; i < a.length; i++ ) {
console.log( 'gcd(%d,%d) = %d', a[ i ], b[ i ], gcd( a[ i ], b[ i ] ) );
}
c
#include "stdlib/math/base/special/gcd.h"
#### stdlib_base_gcd( a, b )
Computes the greatest common divisor (gcd).
c
double v = stdlib_base_gcd( 48.0, 18.0 );
// returns 6.0
The function accepts the following arguments:
- a: [in] double input value.
- b: [in] double input value.
c
double stdlib_base_gcd( const double a, const double b );
c
#include "stdlib/math/base/special/gcd.h"
#include <stdio.h>
int main( void ) {
const double a[] = { 24.0, 32.0, 48.0, 116.0, 33.0 };
const double b[] = { 12.0, 6.0, 15.0, 52.0, 22.0 };
double out;
int i;
for ( i = 0; i < 5; i++ ) {
out = stdlib_base_gcd( a[ i ], b[ i ] );
printf( "gcd(%lf, %lf) = %lf\n", a[ i ], b[ i ], out );
}
}
@stdlib/math-base/special/lcm][@stdlib/math/base/special/lcm]: compute the least common multiple (lcm).
