Timeline for How do you prove that $n^n$ is $O(n!^2)$?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 22, 2011 at 15:24 | history | tweeted | twitter.com/#!/StackMath/status/83556075672055808 | ||
| Jun 22, 2011 at 13:21 | vote | accept | Guillaume Martres | ||
| Jun 22, 2011 at 13:21 | vote | accept | Guillaume Martres | ||
| Jun 22, 2011 at 13:21 | |||||
| Jun 22, 2011 at 13:21 | vote | accept | Guillaume Martres | ||
| Jun 22, 2011 at 13:21 | |||||
| Jun 22, 2011 at 12:42 | answer | added | Shai Covo | timeline score: 12 | |
| Jun 22, 2011 at 12:40 | history | edited | t.b. | CC BY-SA 3.0 |
TeXed title
|
| Jun 22, 2011 at 12:38 | comment | added | t.b. | The lazy person's solution would be to invoke Stirling's approximation, but as the two answers indicate, there are much better ways to see it. You should learn about Stirling, though, it's as useful as it is beautiful. | |
| Jun 22, 2011 at 12:34 | answer | added | lhf | timeline score: 47 | |
| Jun 22, 2011 at 12:32 | answer | added | Phira | timeline score: 11 | |
| Jun 22, 2011 at 12:28 | history | asked | Guillaume Martres | CC BY-SA 3.0 |