You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently, the checksum algorithm implemented is a combination of digit sum (including doubling every other digit in the digit sum), and then a final digit sum to reduce the output to a single digit, but the Luhn algorithm itself includes functions to find the remainder of a mod 10 function (or to achieve a remainder of 0 from a mod 10 function). The function will need to be rewritten to implement this correctly.
The text was updated successfully, but these errors were encountered:
Currently, the checksum algorithm implemented is a combination of digit sum (including doubling every other digit in the digit sum), and then a final digit sum to reduce the output to a single digit, but the Luhn algorithm itself includes functions to find the remainder of a mod 10 function (or to achieve a remainder of 0 from a mod 10 function). The function will need to be rewritten to implement this correctly.
The text was updated successfully, but these errors were encountered: