algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-04 15:39:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: cleanup CoPrimeCheck (#1609)

Browse Source
This commit is contained in:
Piotr Idzik
2024-02-27 09:54:29 +01:00
committed by GitHub
parent fb0a99c15a
commit 0e0cf98ce7
2 changed files with 31 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
Maths/CoPrimeCheck.js
View File

@ -28,13 +28,13 @@ const GetEuclidGCD = (arg1, arg2) => {
const CoPrimeCheck = (firstNumber, secondNumber) => {
// firstly, check that input is a number or not.
if (typeof firstNumber !== 'number' || typeof secondNumber !== 'number') {
return new TypeError('Argument is not a number.')
throw new TypeError('Argument is not a number.')
}
/*
This is the most efficient algorithm for checking co-primes
if the GCD of both the numbers is 1 that means they are co-primes.
*/
return GetEuclidGCD(firstNumber, secondNumber) === 1
return GetEuclidGCD(Math.abs(firstNumber), Math.abs(secondNumber)) === 1
}
export { CoPrimeCheck }