in reply to Re^13: Faster Luhn Check Digit Calculation?
in thread Faster Luhn Check Digit Calculation?
A Luhn mod N algorithm is still OK, but base 10 with a bigger input set would be quite random.
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice
|
|---|