File tree Expand file tree Collapse file tree 1 file changed +4
-4
lines changed
Expand file tree Collapse file tree 1 file changed +4
-4
lines changed Original file line number Diff line number Diff line change @@ -20,10 +20,10 @@ const GetEuclidGCD = require('./GetEuclidGCD')
2020 * @returns return correspond boolean value, if both number are co-prime return `true`, else return `false`.
2121 */
2222const CoPrimeCheck = ( firstNumber , secondNumber ) => {
23- // firstly, check that input is a number or not.
24- if ( typeof firstNumber !== 'number' || typeof secondNumber !== 'number' ) {
25- return new TypeError ( 'Argument is not a number.' ) ;
26- }
23+ // firstly, check that input is a number or not.
24+ if ( typeof firstNumber !== 'number' || typeof secondNumber !== 'number' ) {
25+ return new TypeError ( 'Argument is not a number.' )
26+ }
2727 /*
2828 This is the most efficient algorithm for checking co-primes
2929 if the GCD of both the numbers is 1 that means they are co-primes.
You can’t perform that action at this time.
0 commit comments