Timeline for Sum my Fibonaccified divisors!
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | Community Bot |
Commonmark migration
|
|
| May 23, 2017 at 19:38 | history | edited | JungHwan Min | CC BY-SA 3.0 |
deleted 144 characters in body
|
| May 23, 2017 at 19:30 | history | edited | JungHwan Min | CC BY-SA 3.0 |
added 121 characters in body
|
| May 23, 2017 at 18:08 | comment | added | JungHwan Min |
@JonathanAllan Good idea. (but there are single name functions, like N)
|
|
| May 23, 2017 at 16:45 | comment | added | Jonathan Allan | There are no single letter function names in Mathematica, right? Could you not match all two character strings formed from a leading upper case letter plus a single byte? If so you'd have 26*256=6656 simplified 2-byte function names, enough for the 6356 11.1.1 names with 300 to spare. | |
| May 23, 2017 at 15:03 | comment | added | Neil A. | Well... Using a shorter version of the same language... I guess that works. | |
| May 23, 2017 at 15:02 | history | answered | JungHwan Min | CC BY-SA 3.0 |