

If you want to validate online a PAN number you can try this validator.

Example Initial PAN PAN 3 7 1 4 4 9 6 3 5 3 9 8 4 3 X Step 1 - double the values Double values 3 14 1 8 4 18 6 6 5 6 9 16 4 6 X Step2 - sum the digits Sum digits 3 5 1 8 4 9 6 6 5 6 9 7 4 6 X Step3 - sum all digits3 + 5 + 1 + 8 + 4 + 9 + 6 + 6 + 5 + 6 + 9 + 7 + 4 + 6 = 79 Step4 - multiply by 979 x 9 = 711 Result If the product of this doubling operation is greater than 9, then sum the digits of the products or alternatively subtract 9 from the product.From the rightmost digit, which is the check digit, moving left, double the value of every second digit.The check digit is obtained by computing the sum of the non-check digits then computing 9 times that value modulo 10. It will not, however, detect transposition of the two-digit sequence 09 to 90 (or vice versa). This 8-bit Checksum Calculator can be used to calculate the 8-bit Checksum of a sequence of hexadecimal values or bytes. It is certainly easier to calculate a checksum, but checksums do not find all. The Luhn algorithm will detect any single-digit error, as well as almost all transpositions of adjacent digits. One might think, that using a checksum can replace proper CRC calculations. The algorithm was designed to protect against accidental errors. The algorithm is specified in ISO/IEC 7812-1.

The Luhn algorithm ("modulus 10" or "mod 10" algorithm, Luhn formula) is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers (PAN) or IMEI numbers.
