...
The version table should be updated each time the document receives significant edits and is passed to an audience other than close participants to an editing process.
| Author(s) | Change Description | Date | |
|---|---|---|---|---|
| 1.0 | First Published Draft Version | 2008-Mar-03 | ||
1.1 | Lorie Carey | Changes based on draft feedback | 2008-Jul-02 | |
1.2 | Lorie Carey | Changes resulting from PRM White Paper | 2008-Oct-06 | |
02.03.00 | Lorie Carey | Updated to include processes to support French translations | 2009-Apr-14 | |
04.00.00 | Lorie Carey | Update and revise document | 2012-July-23 | |
04.01.00 | Lorie Carey | Published version | 2012-July-31 | |
04.01.01 | Lorie Carey | URL edits | 2012-Aug-20 | |
04.02.00 | Lorie Carey | Changes to reflect new RFC processes | 2014-Jan-29 | |
05.00.00 | Lorie Carey | Changes to reflect new pCLOCD Terms of Use, added hyperlink to new LOINC codes | 2014-Jul-29 | |
05.01.00 | Lorie Carey | Updated | 2015-Jan-28 | |
05.07.00 | Linda Monico | Updated | 2017-July-28 | |
05.12.00 | Linda Monico | Updated | 2020-Jul |
...
Instructions | Example Using the number: 12345 |
|---|---|
1) Assign positions to the digits, from right to left | 1st = 5 2nd = 4 3rd = 3 4th = 2 5th = 1 |
2) Take the odd digit positions counting from the right (1st, 3rd, 5th, etc.) | 531 |
3) Multiply by 2 | 1062 |
4) Take the even digit positions starting from the right (2nd, 4th, etc.) | 42 |
5) Append (4) to the front of the results of (3) | 421062 |
6) Add the digits of (5) together | 4+2+1+0+6+2 = 15 |
7) Find the next highest multiple of 10 | 20 |
8) Subtract (6) from (7) | 20 - 15 = 5 |
Thus, 5 is the Mod 10 check digit for 12345 | 12345-5 |
Table 2 Mod-10 Algorithm
| Table of Contents |
|---|