Single digit calculated from the other digits using the Luhn algorithm.

Modulo 10 check digits in credit card account numbers, calculated with the Luhn algorithm.

For purely numerical data, such as the library barcode pictured above, the Luhn algorithm is popular.

According to E.118, the number is up to 19 digits long, including a single check digit calculated using the Luhn algorithm.

A check-digit can be calculated from the 18 digit result using the standard base 10 Luhn algorithm and appended to the end.

Like the more widely known Luhn algorithm, it works with strings of decimal digits of any length.

Unlike the Luhn algorithm, the calculations required for a Verhoeff check digit cannot readily be performed by hand from memory.

The last number of the IMEI is a check digit calculated using the Luhn algorithm.

The simplest approach (akin to the original Luhn algorithm) is to use ASCII code arithmetic.

The remainder of the IMEI is manufacturer-defined, with a Luhn algorithm at the end (which is never transmitted).

This generator worked by exploiting the algorithm used by credit card companies known as the Luhn algorithm to dynamically generate apparently legitimate credit card numbers.

The final digit is a check digit which is calculated using the Luhn algorithm, defined in Annex B of ISO/IEC 7812-1.

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 non-numeric characters.

Some checksum schemes, such as the Damm algorithm, the Luhn algorithm, and the Verhoeff algorithm, are specifically designed to detect errors commonly introduced by humans in writing down or remembering identification numbers.