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 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.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
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 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.
has abstract
The Luhn mod N algorithm is an ...... arbitrary set of N characters.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
992,355,448
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
The Luhn mod N algorithm is an ...... arbitrary set of N characters.
@en
label
Luhn mod N algorithm
@en