Search for a tool
Luhn Number Checksum

Tools to check Luhn generated numbers. The Luhn algorithm (also called modulo 10 or mod 10) is a checksum formula for numbers/digits used with credit card or administrative numbers.

Results

Luhn Number Checksum -

Tag(s) : Checksum, Algorithm, Arithmetics, Mathematics

dCode and you

dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day!
You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

Team dCode read all messages and answer them if you leave an email (not published). It is thanks to you that dCode has the best Luhn Number Checksum tool. Thank you.

# Luhn Number Checksum

## Number with Missing Digits

Tools to check Luhn generated numbers. The Luhn algorithm (also called modulo 10 or mod 10) is a checksum formula for numbers/digits used with credit card or administrative numbers.

### What is the Luhn Algorithm for?

This algorithm allows checking credit card numbers MasterCard/AMEX/Visa of IMEI codes for example by using a control key checksum. If one character is badly written, in the Luhn algorithm can detect it.

Example: 12345674 is a valid card number, 1234567 is the main original number and 4 is the checksum.

Example: If a user enter 13245674 (2 and 3 are switched), then the program calculates the checksum for 1324567 and finds 5 instead of 4 expected, the number is invalid and so has been badly typed.

### How to verify a number with Luhn? (Validity check)

The algorithm starts by the end of the number, from the last right digit to the first left digit. Realize a sum of digits by multiplying by 2 all digits of even rank. If the double is equal or superior to 10, replace it by the sum of its digits. The control digit number is equal to (10-sum%10) % 10.

Example: The number 853X, with X=0, the digit to calculate.
Take the digit 3, doubled, 3*2 = 6.
Takes the digit 5, not multiplied by 2
Take the 8, multiplies it by 2 : 8*2=16 and 1+6=7 to get 7.

Example: The sum is 6+5+7 = 18. As 18 modulo 10 = 8, one calculated (10 - 8) %10 = 2, 2 is the digit checksum control. So 8532 is valid according to Luhn.