Timeline for A prime test that's LITERALLY prime
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 2, 2018 at 12:40 | comment | added | fquarp | @Laikoni well done. I think yours will be hard to beat. | |
| Apr 2, 2018 at 10:40 | comment | added | Laikoni | Also welcome to PPCG! | |
| Apr 2, 2018 at 10:39 | comment | added | Laikoni | 47 bytes with a different primality test: Try it online! (note that there are tabs instead of spaces to get the count right). | |
| Apr 2, 2018 at 9:23 | comment | added | fquarp | Good call. However, we then get some code that `hashes' to an even value. Adding spaces or new-lines does nothing (even values), nor does changing the name of the variable (it appears four times, so replacing its code (say c) amounts to subtracting 4 * c and adding 4 * c', leaving the sum even. However, it can be tweaked by breaking the lines and still be shorter, which I did. | |
| Apr 2, 2018 at 9:18 | history | edited | fquarp | CC BY-SA 3.0 |
Shorter form without :: IO Int
|
| Apr 2, 2018 at 0:11 | comment | added | Ørjan Johansen |
The ::IO Int really shouldn't be necessary unless that's the shortest way you can get a prime sum.
|
|
| Apr 1, 2018 at 21:00 | comment | added | fquarp | Turned it into a full standalone program. | |
| Apr 1, 2018 at 20:57 | history | edited | fquarp | CC BY-SA 3.0 |
Improved the title
|
| Apr 1, 2018 at 20:35 | review | Late answers | |||
| Apr 1, 2018 at 21:10 | |||||
| Apr 1, 2018 at 20:20 | review | First posts | |||
| Apr 1, 2018 at 20:24 | |||||
| Apr 1, 2018 at 20:18 | history | answered | fquarp | CC BY-SA 3.0 |