L("XXYY") = ( L("XX") + L("YY") ) % 10
for all even length substrings XX and YY ...
I think I see where you're going, and I think you're right. Even with just a 0 .. 9999 / 10K character lookup string, a 13-16 digit number's Luhn checksum character could be found with four substr lookups, three adds and a mod; likely quite fast. Going to six digits would only reduce by one lookup and one add; I'm not sure it would be worth the memory. Looks like you've found a nice project to occupy your Sunday :)
Give a man a fish: <%-{-{-{-<
In reply to Re^5: Faster Luhn Check Digit Calculation?
by AnomalousMonk
in thread Faster Luhn Check Digit Calculation?
by kschwab
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |