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!
lcm
[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url]
Compute the [least common multiple][lcm] (lcm).
a and b is the smallest positive integer that is divisible by both a and b. The lcm is also known as the lowest common multiple or smallest common multiple and finds common use in calculating the lowest common denominator (lcd).
bash
npm install @stdlib/math-base-special-lcm
javascript
var lcm = require( '@stdlib/math-base-special-lcm' );
#### lcm( a, b )
Computes the [least common multiple][lcm] (lcm).
javascript
var v = lcm( 48, 18 );
// returns 144
If either a or b is 0, the function returns 0.
javascript
var v = lcm( 0, 0 );
// returns 0
v = lcm( 2, 0 );
// returns 0
v = lcm( 0, 3 );
// returns 0
Both a and b must have integer values; otherwise, the function returns NaN.
javascript
var v = lcm( 3.14, 18 );
// returns NaN
v = lcm( 48, 3.14 );
// returns NaN
v = lcm( NaN, 18 );
// returns NaN
v = lcm( 48, NaN );
// returns NaN
javascript
var randu = require( '@stdlib/random-base-randu' );
var round = require( '@stdlib/math-base-special-round' );
var lcm = require( '@stdlib/math-base-special-lcm' );
var a;
var b;
var v;
var i;
for ( i = 0; i < 100; i++ ) {
a = round( randu()*50 );
b = round( randu()*50 );
v = lcm( a, b );
console.log( 'lcm(%d,%d) = %d', a, b, v );
}
c
#include "stdlib/math/base/special/lcm.h"
#### stdlib_base_lcm( a, b )
Computes the [least common multiple][lcm] (lcm).
c
double v = stdlib_base_lcm( 48.0, 18.0 );
// returns 144.0
The function accepts the following arguments:
- a: [in] double input value.
- b: [in] double input value.
c
double stdlib_base_lcm( const double a, const double b );
c
#include "stdlib/math/base/special/lcm.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_lcm( a[ i ], b[ i ] );
printf( "lcm(%lf, %lf) = %lf\n", a[ i ], b[ i ], out );
}
}
@stdlib/math-base/special/gcd][@stdlib/math/base/special/gcd]: compute the greatest common divisor (gcd).
