Timeline for Sum over permutations is 1
Current License: CC BY-SA 3.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 20, 2017 at 17:40 | history | edited | T. Amdeberhan | CC BY-SA 3.0 |
added 5 characters in body
|
| S Feb 17, 2017 at 15:12 | history | suggested | Peter Mortensen | CC BY-SA 3.0 |
Copy edited.
|
| Feb 17, 2017 at 15:11 | review | Suggested edits | |||
| S Feb 17, 2017 at 15:12 | |||||
| Feb 17, 2017 at 14:17 | vote | accept | T. Amdeberhan | ||
| Feb 17, 2017 at 14:17 | vote | accept | T. Amdeberhan | ||
| Feb 17, 2017 at 14:17 | |||||
| Feb 16, 2017 at 22:20 | history | edited | T. Amdeberhan | CC BY-SA 3.0 |
added 9 characters in body
|
| Feb 16, 2017 at 16:13 | history | edited | T. Amdeberhan | CC BY-SA 3.0 |
deleted 123 characters in body
|
| Feb 16, 2017 at 14:47 | answer | added | Fedor Petrov | timeline score: 29 | |
| Feb 16, 2017 at 12:50 | history | edited | T. Amdeberhan | CC BY-SA 3.0 |
added 261 characters in body
|
| Feb 16, 2017 at 12:46 | comment | added | T. Amdeberhan | Computer-tested. In the present case, you can't go far with your data because $\mathfrak{S}_n$ grows very quickly. So, you also need a "leap of faith". | |
| Feb 16, 2017 at 8:54 | comment | added | Martin Rubey | Are all these identities in question computer-generated? | |
| Feb 16, 2017 at 8:34 | answer | added | Fedor Petrov | timeline score: 22 | |
| Feb 16, 2017 at 5:49 | history | edited | T. Amdeberhan | CC BY-SA 3.0 |
added 231 characters in body
|
| Feb 16, 2017 at 5:38 | answer | added | Lucia | timeline score: 35 | |
| Feb 16, 2017 at 5:27 | comment | added | T. Amdeberhan | Yes, for $n<7$. | |
| Feb 16, 2017 at 5:21 | comment | added | Gerry Myerson | Is it true for $n=2$? 3? 4? | |
| Feb 16, 2017 at 5:09 | history | asked | T. Amdeberhan | CC BY-SA 3.0 |