Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 321x 321x 321x 1x 1x 1x 1x 1x | /**
* @license Apache-2.0
*
* Copyright (c) 2024 The Stdlib Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
'use strict';
// MODULES //
var Boolean = require( '@stdlib/boolean/ctor' );
var addon = require( './../src/addon.node' );
// MAIN //
/**
* Returns a boolean indicating whether two numbers are coprime.
*
* @private
* @param {number} a - first value
* @param {number} b - second value
* @returns {boolean} boolean indicating whether the values are coprime
*
* @example
* var bool = isCoprime( 14.0, 15.0 );
* // returns true
*
* @example
* var bool = isCoprime( 14.0, 21.0 );
* // returns false
*/
function isCoprime( a, b ) {
return Boolean( addon( a, b ) );
}
// EXPORTS //
module.exports = isCoprime;
|