Implements the Luhn Algorithm used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, National Provider Identifier numbers etc.
String.prototype.split()
, Array.prototype.reverse()
and Array.prototype.map()
in combination with parseInt()
to obtain an array of digits.Array.prototype.shift()
to obtain the last digit.Array.prototype.reduce()
to implement the Luhn Algorithm.true
if sum
is divisible by 10
, false
otherwise.const luhnCheck = num => {
const arr = (num + '')
.split('')
.reverse()
.map(x => parseInt(x));
const lastDigit = arr.shift();
let sum = arr.reduce(
(acc, val, i) => (i % 2 !== 0 ? acc + val : acc + ((val *= 2) > 9 ? val - 9 : val)),
0
);
sum += lastDigit;
return sum % 10 === 0;
};
luhnCheck('4485275742308327'); // true
luhnCheck(6011329933655299); // true
luhnCheck(123456789); // false
JavaScript, Math
Generates primes up to a given number, using the Sieve of Eratosthenes.
JavaScript, Math
Finds the prime factors of a given number using the trial division algorithm.
JavaScript, Math
Checks if the provided integer is a prime number.