mirror of
https://github.com/freeCodeCamp/freeCodeCamp.git
synced 2026-05-28 18:26:54 +00:00
fix: fixed first person into generic for luhn algo (#67424)
This commit is contained in:
committed by
GitHub
parent
e2aa7ce383
commit
12be3d283b
@@ -14,7 +14,7 @@ The Luhn algorithm, also known as the "modulus 10" or "mod 10" algorithm, is a s
|
||||
- Take the sum of all the digits including the check digit.
|
||||
- If the sum of all the digits is a multiple of `10`, then the number is valid; else it is not valid.
|
||||
|
||||
Let's say we have the number `453914881`. The steps to validate it using the Luhn algorithm would be:
|
||||
For example, consider the number `453914881`. The steps to validate it using the Luhn algorithm are:
|
||||
|
||||
```md
|
||||
Account number 4 5 3 9 1 4 8 8 1
|
||||
|
||||
Reference in New Issue
Block a user