The Luhn Check Digit Algorithm
The Luhn algorithm is primarily used for the validation of credit card numbers. Not only does this provide a catcher for data-entry errors, it also doubles as a weak security tool. Most credit cards and many government identification numbers use the algorithm as a simple method of distinguishing valid numbers from collections of random digits.
See below for an example of how the Algorithm works, or use the attached .jar file to do the work for you.
The following steps are required to validate the primary account number (originally excerpted from http://www.beachnet.com/~hstiles/cardtype.html, but that page is no longer active):
Step 1: Double the value of alternate digits of the primary account number beginning with the second digit from the right (the first right--hand digit is the check digit.)
Step 2: Add the individual digits comprising the products obtained in Step 1 to each of the unaffected digits in the original number.
Step 3: The total obtained in Step 2 must be a number ending in zero (30, 40, 50, etc.) for the account number to be validated.
For example, to validate the primary account number 49927398716:
Step 1:
4 9 9 2 7 3 9 8 7 1 6 x2 x2 x2 x2 x2 ------------------------------ 18 4 6 16 2
Step 2: 4 +(1+8)+ 9 + (4) + 7 + (6) + 9 +(1+6) + 7 + (2) + 6
Step 3: Sum = 70 : Card number is validated
Note: Card is valid because the 70/10 yields no remainder.
[The original source above notes that ICVERIFY is the original source of this data.]
Make sure that you: