Level Triple-A Conformance to Web Content Accessibility Guidelines 1.0
Pages bearing this logo indicate a claim of
by the page author or content provider to conformance
level Triple-A of the W3C , including all Priority 1, ,
checkpoints
defined in the Guidelines.
The Web Content Accessibility Guidelines 1.0 explain how to make
Web content accessible to people
with disabilities. Conformance to these Guidelines will help make
the Web more accessible to users with disabilities and will
benefit all users.
Claims are not verified by W3C.
Content providers
are solely responsible for the use of these logos.ImsiChecker_百度知道
ImsiChecker
您的回答被采纳后将获得：
系统奖励20（财富值+经验值）+难题奖励20（财富值+经验值）+提问者悬赏20（财富值+经验值）
我有更好的答案
什么意思？
为您推荐：
等待您来回答
下载知道APP
随时随地咨询
出门在外也不愁114网址导航的海词问答和网友补充：
相关词典网站：From Wikipedia, the free encyclopedia
The Luhn algorithm or Luhn formula, also known as the " 10" or "mod 10" , is a simple
formula used to validate a variety of identification numbers, such as , ,
in the US, and
. It was created by
and described in , filed on January 6, 1954, and granted on August 23, 1960.
The algorithm is in the
and is in wide use today. It is specified in -1. It is n it was designed to protect against accidental errors, not malicious attacks. Most credit cards and many government identification numbers use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.
The formula verifies a number against its included , which is usually appended to a partial account number to generate the full account number. This number must pass the following test:
From the rightmost digit, which is the check digit, moving left, double the value o if the product of this doubling operation is greater than 9 (e.g., 8 × 2 = 16), then sum the digits of the products (e.g., 16: 1 + 6 = 7, 18: 1 + 8 = 9) or alternatively subtract 9 from the product (e.g., 16: 16 - 9 = 7, 18: 18 - 9 = 9).
Take the sum of all the digits.
If the total
10 is equal to 0 (if the total ends in zero) then the number is valid according to the L else it is not valid.
Assume an example of an account number "" that will have a check digit added, making it of the form x:
Account number
Double every other
Sum digits
The sum of all the digits in the third row is 67+x.
The check digit (x) is obtained by computing the sum of the non-check digits then computing 9 times that value modulo 10 (in equation form, (67 × 9 mod 10)). In algorithm form:
Compute the sum of the non-check digits (67).
Multiply by 9 (603).
The last digit, 3, is the check digit. Thus, x=3.
(Alternative method) The check digit (x) is obtained by computing the sum of the other digits then subtracting the units digit from 10 (67 =& Units digit 7; 10 - 7 = check digit 3). In algorithm form:
Compute the sum of the digits (67).
Take the units digit (7).
Subtract the units digit from 10.
The result (3) is the check digit. In case the sum of digits ends in 0, 0 is the check digit.
This makes the full account number read .
Each of the numbers , , , , , , , , ,
can be validated as follows.
Double every second digit, from the rightmost: (1×2) = 2, (8×2) = 16, (3×2) = 6, (2×2) = 4, (9×2) = 18
Sum all the individual digits (digits in parentheses are the products from Step 1): x (the check digit) + (2) + 7 + (1+6) + 9 + (6) + 7 + (4) + 9 + (1+8) + 7 = x + 67.
If the sum is a multiple of 10, the account number is possibly valid. Note that 3 is the only valid digit that produces a sum (70) that is a multiple of 10.
Thus these account numbers are all invalid except possibly
which has the correct check digit.
Alternately, you can use the same checksum creation algorithm, ignoring the checksum already in place as if it had not yet been calculated. Then calculate the checksum and compare this calculated checksum to the original checksum included with the credit card number. If the included checksum matches the calculated checksum, then the number is valid.
The Luhn algorithm will detect any single-digit error, as well as almost all transpositions of adjacent digits. It will not, however, detect transposition of the two-digit sequence 09 to 90 (or vice versa). It will detect 7 of the 10 possible twin errors (it will not detect 22
Other, more complex check-digit algorithms (such as the
and the ) can detect more transcription errors. The
is an extension that supports non-numerical strings.
Because the algorithm operates on the digits in a right-to-left manner and zero digits affect the result only if they cause shift in position, zero-padding the beginning of a string of numbers does not affect the calculation. Therefore, systems that pad to a specific number of digits (by converting 1234 to 0001234 for instance) can perform Luhn validation before or after the padding and achieve the same result.
Prepending a 0 to odd-length numbers makes it possible to process the number from left to right rather than right to left, doubling the odd-place digits.
The algorithm appeared in a US Patent for a hand-held, mechanical device for computing the checksum. It was therefore required to be rather simple. The device took the mod 10 sum by mechanical means. The substitution digits, that is, the results of the double and reduce procedure, were not produced mechanically. Rather, the digits were marked in their permuted order on the body of the machine.
The implementations below are in .
def digits_of(number):
return list(map(int, str(number)))
def luhn_checksum(card_number):
digits = digits_of(card_number)
odd_digits = digits[-1::-2]
even_digits = digits[-2::-2]
total = sum(odd_digits)
for digit in even_digits:
total += sum(digits_of(2 * digit))
return total % 10
def is_luhn_valid(card_number):
return luhn_checksum(card_number) == 0
The algorithm above checks the validity of an input with a check digit. Calculating the check digit requires only a slight adaptation of the algorithm—namely:
def calculate_luhn(partial_card_number):
check_digit = luhn_checksum(int(partial_card_number) * 10)
# Append a zero check digit to the partial number and calculate checksum
return check_digit if check_digit == 0 else 10 - check_digit # If the (sum mod 10) == 0, then the check digit is 0
# Else, the check digit = 10 - (sum mod 10)
: Hidden categories: