current position:Home>ISO 7064:1983. Mod11-2 verification code calculation method (18 digit verification code calculation of ID card)

ISO 7064:1983. Mod11-2 verification code calculation method (18 digit verification code calculation of ID card)

2022-01-26 23:20:41 Koki

/*
 Use 【ISO 7064:1983.MOD 11-2】 Calculation 【 ID verification code 】
 Put the ID number on the front 17 The digits are multiplied by different coefficients .
 The coefficients from the first to the seventeenth are :7-9-10-5-8-4-2-1-6-3-7-9-10-5-8-4-2.
 Will this 17 The result of multiplication of digits and coefficients is added 
 Add and divide by 11, See what the remainder is ?
 Remainder can only be :        0-1-2-3-4-5-6-7-8-9-10
 Validation code corresponding to remainder :1-0-X -9-8-7-6-5-4-3-2
【 Columns such as 】
 Remainder is 7, Then the corresponding validation code is 5
【 Example 】
 coefficient x Before the ID card 17 position ( Single split multiplication ) And =S
S/11 = S Except in 11=T...3 ( And divide in 11 The remainder of the result )
3==9( Parity code for remainder )
【 The formula 】
 A man's ID number is 【53010219200508011?】 Only before 17 Digit number , Then we don't know that the last valid code can be solved by this formula :
 Id card :5    3    0    1    0    2    1    9    2    0    0    5    0    8    0    1    1
		                                            || Multiply ||
 coefficient :  7    9   10    5    8    4    2    1    6    3    7    9   10    5    8    4    2
   

copyright notice
author[Koki],Please bring the original link to reprint, thank you.
https://en.cdmana.com/2022/01/202201262320398885.html

Random recommended