Formula for validating dea number farmers journal dating
For the purpose of taking the pharmacy tech national exam (i.e.
PTCB or Ex CPT), knowing how to do this initial check is advised.
The Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, National Provider Identifier numbers in the United States, Canadian Social Insurance Numbers, Israel ID Numbers and Greek Social Security Numbers (ΑΜΚΑ). 2,950,048, filed on January 6, 1954, and granted on August 23, 1960.
It was created by IBM scientist Hans Peter Luhn and described in U. The algorithm is in the public domain and is in wide use today. It is not intended to be a cryptographically secure hash function; it was designed to protect against accidental errors, not malicious attacks.
The best way for the public to ascertain a physician's status is to check with a state's medical board.
Alternately, you can use the same checksum creation algorithm, ignoring the checksum already in place as if it had not yet been calculated.
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).
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 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)).