Start of main content
Implements the Luhn Algorithm used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, National Provider Identifier numbers etc.
- Use
String.prototype.split(),Array.prototype.reverse()andArray.prototype.map()in combination withparseInt()to obtain an array of digits. - Use
Array.prototype.shift()to obtain the last digit. - Use
Array.prototype.reduce()to implement the Luhn Algorithm. - Return
trueifsumis divisible by10,falseotherwise.
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); // falseRecommended snippets
Primes up to given number
JavaScript, Math
Generates primes up to a given number, using the Sieve of Eratosthenes.
Prime factors of number
JavaScript, Math
Finds the prime factors of a given number using the trial division algorithm.
Number is prime
JavaScript, Math
Checks if the provided integer is a prime number.