Luhn mod N algorithm

The Luhn mod N algorithm is an extension to the Luhn algorithm (also known as mod 10 algorithm) that allows it to work with sequences of values in any even-numbered base. This can be useful when a check digit is required to validate an identification string composed of letters, a combination of letters and digits or any arbitrary set of N characters where N is divisible by 2.

Comment
enThe Luhn mod N algorithm is an extension to the Luhn algorithm (also known as mod 10 algorithm) that allows it to work with sequences of values in any even-numbered base. This can be useful when a check digit is required to validate an identification string composed of letters, a combination of letters and digits or any arbitrary set of N characters where N is divisible by 2.
Has abstract
enThe Luhn mod N algorithm is an extension to the Luhn algorithm (also known as mod 10 algorithm) that allows it to work with sequences of values in any even-numbered base. This can be useful when a check digit is required to validate an identification string composed of letters, a combination of letters and digits or any arbitrary set of N characters where N is divisible by 2.
Hypernym
Extension
Is primary topic of
Luhn mod N algorithm
Label
enLuhn mod N algorithm
Link from a Wikipage to another Wikipage
Associative array
Category:Articles with example code
Category:Articles with example C Sharp code
Category:Checksum algorithms
Category:Modular arithmetic
Decimal
English alphabet
International Securities Identification Number
Luhn algorithm
Radix
SameAs
4qmJG
Luhn mod N algorithm
m.0gtjtr
Q6699881
Subject
Category:Articles with example code
Category:Articles with example C Sharp code
Category:Checksum algorithms
Category:Modular arithmetic
WasDerivedFrom
Luhn mod N algorithm?oldid=1117219145&ns=0
WikiPageLength
14773
Wikipage page ID
6870554
Wikipage revision ID
1117219145
WikiPageUsesTemplate
Template:Not a typo
Template:Unreferenced
Template:Var