Timeline for Smallest n-digit prime containing only these digits
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 10, 2017 at 0:16 | history | edited | George Reith | CC BY-SA 3.0 |
added 45 characters in body
|
| Feb 10, 2017 at 0:08 | history | edited | George Reith | CC BY-SA 3.0 |
added 140 characters in body
|
| Feb 9, 2017 at 23:55 | comment | added | George Reith | @ETHproductions Aye neither did I until I read the spec I posted XD my first variation of the answer did use that shortcut until I realised it was invalid. | |
| Feb 9, 2017 at 23:54 | history | edited | George Reith | CC BY-SA 3.0 |
edited body
|
| Feb 9, 2017 at 23:52 | comment | added | ETHproductions | Oh, I didn't realize TCO only applied in strict mode. | |
| Feb 9, 2017 at 23:49 | comment | added | George Reith | @ETHproductions Can't because it has to be run in strict mode (to avoid stack overflow) and that creates a global variable P. | |
| Feb 9, 2017 at 23:48 | history | edited | George Reith | CC BY-SA 3.0 |
added 570 characters in body
|
| Feb 9, 2017 at 23:46 | comment | added | ETHproductions |
I think you can save two bytes with F=i=>(P=j=>i%--j?P(j):1==j)(i)&&...
|
|
| Feb 9, 2017 at 23:38 | history | edited | George Reith | CC BY-SA 3.0 |
added 2 characters in body
|
| Feb 9, 2017 at 23:18 | history | edited | George Reith | CC BY-SA 3.0 |
added 146 characters in body
|
| Feb 9, 2017 at 23:10 | history | answered | George Reith | CC BY-SA 3.0 |