Verhoeff algorithm: Difference between revisions
Content added Content deleted
(Created new draft task, Verhoeff algorithm, and added a Wren solution.) |
m (Typo.) |
||
| Line 3: | Line 3: | ||
The [https://en.wikipedia.org/wiki/Verhoeff_algorithm Verhoeff algorithm] is a checksum formula for error detection developed by the Dutch mathematician Jacobus Verhoeff and first published in 1969. It was the first decimal check digit algorithm which detects all single-digit errors, and all transposition errors involving two adjacent digits, which was at the time thought impossible with such a code. |
The [https://en.wikipedia.org/wiki/Verhoeff_algorithm Verhoeff algorithm] is a checksum formula for error detection developed by the Dutch mathematician Jacobus Verhoeff and first published in 1969. It was the first decimal check digit algorithm which detects all single-digit errors, and all transposition errors involving two adjacent digits, which was at the time thought impossible with such a code. |
||
As the workings of the |
As the workings of the algorithm are clearly described in the linked Wikipedia article they will not be repeated here. |
||
;Task: |
;Task: |
||