Timeline for Prime counting function
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:39 | history | edited | CommunityBot |
replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/
|
|
| Sep 23, 2016 at 22:07 | history | edited | Luis Mendo | CC BY-SA 3.0 |
deleted 8 characters in body
|
| Sep 23, 2016 at 21:54 | comment | added | Luis Mendo | @Dennis Thanks! I've used the first suggestion. The second one is too different, and is your approach | |
| Sep 23, 2016 at 21:53 | history | edited | Luis Mendo | CC BY-SA 3.0 |
added 30 characters in body
|
| Sep 23, 2016 at 21:43 | comment | added | Dennis |
You only need the maximal length of the results of ÆE, as each exponent corresponds to a different prime factor. RÆESL achieves just that. !ÆEL would be even shorter.
|
|
| Sep 23, 2016 at 21:24 | history | edited | Luis Mendo | CC BY-SA 3.0 |
added 18 characters in body
|
| Sep 23, 2016 at 20:27 | history | edited | Luis Mendo | CC BY-SA 3.0 |
added 21 characters in body
|
| Sep 23, 2016 at 20:26 | comment | added | DJMcMayhem | Correction: port of Luis Mendo's: DJMcMayhem's MATL answer. :P | |
| Sep 23, 2016 at 20:24 | history | answered | Luis Mendo | CC BY-SA 3.0 |