Timeline for How many steps does it take from n to 1 by subtracting the greatest divisor?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | Community Bot |
Commonmark migration
|
|
| Apr 13, 2020 at 8:08 | comment | added | Lemming |
You can save a character by rewriting (f$...) to f(...).
|
|
| Apr 13, 2018 at 15:25 | comment | added | Angs |
List comprehension and <1 instead of ==0 saves a few bytes: f 1=0;f n=1+f(n-last[a|a<-[1..ndiv2],mod n a<1])
|
|
| May 13, 2016 at 9:29 | history | edited | Alexandru Dinu | CC BY-SA 3.0 |
added 82 characters in body
|
| May 13, 2016 at 9:28 | review | First posts | |||
| May 13, 2016 at 14:14 | |||||
| May 13, 2016 at 9:24 | history | answered | Alexandru Dinu | CC BY-SA 3.0 |