Timeline for Time-efficient way of calculating the least number of 1s in a representation of $n$ using only the operations $+,!$
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 15, 2016 at 23:21 | review | First posts | |||
| Apr 16, 2016 at 0:17 | |||||
| Apr 13, 2016 at 20:47 | vote | accept | CommunityBot | ||
| Apr 13, 2016 at 17:07 | answer | added | Douglas Zare | timeline score: 6 | |
| S Apr 13, 2016 at 16:47 | history | edited | Sebastian Goette | CC BY-SA 3.0 |
more explicit paper reference; some cleaning up, \cdots and underbrace replaced by a 1; more descriptive title
|
| S Apr 13, 2016 at 16:47 | history | suggested | user642796 | CC BY-SA 3.0 |
more explicit paper reference; some cleaning up, \cdots and underbrace replaced by a 1; more descriptive title
|
| Apr 13, 2016 at 15:57 | review | Suggested edits | |||
| S Apr 13, 2016 at 16:47 | |||||
| Apr 13, 2016 at 14:36 | comment | added | user90242 | Yes, it is actually, that was one of my problems with a general method | |
| Apr 13, 2016 at 14:32 | comment | added | joro | Is this allowed: $720=((1+1+1)!)!$? | |
| S Apr 13, 2016 at 10:17 | history | suggested | user83633 | CC BY-SA 3.0 |
missing notation added
|
| Apr 13, 2016 at 9:58 | review | Suggested edits | |||
| S Apr 13, 2016 at 10:17 | |||||
| Apr 13, 2016 at 7:31 | comment | added | user642796 | Do you know if there is an $n \geq 6$ such that $\| n \| \neq \| a \| + \| n-a! \|$ where $a$ is greatest such that $a! \leq n$? | |
| S Apr 13, 2016 at 6:49 | history | suggested | Amir Sagiv | CC BY-SA 3.0 |
Changed links to improve readability
|
| Apr 13, 2016 at 6:49 | review | Suggested edits | |||
| S Apr 13, 2016 at 6:49 | |||||
| Apr 13, 2016 at 6:42 | history | asked | user90242 | CC BY-SA 3.0 |