Timeline for The Luhn algorithm for verifying credit card numbers, etc
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 23, 2019 at 10:54 | comment | added | Kateba |
==0 can be shortened to <1
|
|
| Feb 1, 2014 at 23:14 | comment | added | ThinkChaos |
You can save two more chars by not looping backwards : D[-2::-2] -> D[1::2] as the order of a sum isn't important :)
|
|
| Jan 30, 2011 at 19:42 | history | edited | Keith Randall | CC BY-SA 2.5 |
one sum over two adjacent lists
|
| Jan 29, 2011 at 8:53 | history | answered | Keith Randall | CC BY-SA 2.5 |