Timeline for How many steps does it take from n to 1 by subtracting the greatest divisor?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | Community Bot |
Commonmark migration
|
|
| Apr 13, 2018 at 15:00 | history | edited | edc65 | CC BY-SA 3.0 |
added 52 characters in body
|
| Apr 13, 2018 at 14:55 | comment | added | edc65 | @l4m2 right, why not? Thanks | |
| Apr 13, 2018 at 3:50 | comment | added | l4m2 |
Why not f=(n,d=n)=>n>1?n%--d?f(n,d):f(n-d)+1:0?
|
|
| May 12, 2016 at 13:44 | comment | added | Neil | I need new glasses. | |
| May 11, 2016 at 14:18 | comment | added | edc65 | @Neil thinking again: no. "Let n be a natural number ≥ 2 ..." | |
| May 11, 2016 at 11:39 | comment | added | Neil | Nice, but I think you should spend the two bytes needed to make f(1) == 0. | |
| May 10, 2016 at 13:20 | history | edited | edc65 | CC BY-SA 3.0 |
added 330 characters in body
|
| May 10, 2016 at 12:49 | history | answered | edc65 | CC BY-SA 3.0 |