Timeline for Is it a Chen prime?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jul 11, 2017 at 6:54 | history | edited | Kevin Cruijssen | CC BY-SA 3.0 |
Iterative instead of recursive for -1 byte
|
| Jul 10, 2017 at 22:59 | comment | added | Olivier Grégoire |
The iterative version is just a byte shorter: n->{int N=n+2,f=0,F=0,d=1;for(;d++<n;f+=n%d<1?1:0)F+=N%d<1?1:0;return n>1&f<2&F<3;}.
|
|
| Jul 10, 2017 at 13:28 | history | answered | Kevin Cruijssen | CC BY-SA 3.0 |