This allows for an identifier like "139MT" that the original Luhn algorithm cannot handle (it's limited to numeric digits only).Īllowing letters- even limited to capital letters-does not increase the accuracy of data entry. In this variation, we allow for letters as well as numbers in the identifier (i.e., alphanumeric identifiers). We have borrowed the variation on the Luhn algorithm used by Regenstrief Institute, Inc. Our variation on the Luhn algorithm Allowing for Letters For a sum of '14', the check digit is '6' since '20' is the next number divisible by ten. So the answer is '1 + 8 + 3 + 2 = 14' and the check digit is the amount needed to reach a number divisible by ten. Now sum all of the digits (note '18' is two digits, '1' and '8'). Work right-to-left, using "139" and doubling every other digit.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |