Timeline for Upper limit on the central binomial coefficient
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 8, 2023 at 17:16 | history | edited | Martin Sleziak |
edited tags
|
|
| Nov 8, 2023 at 17:07 | history | edited | Michael Hardy | CC BY-SA 4.0 |
added 4 characters in body
|
| Feb 24, 2021 at 10:25 | answer | added | robjohn | timeline score: 9 | |
| Jan 3, 2021 at 9:43 | answer | added | Fedor Petrov | timeline score: 5 | |
| Jan 2, 2021 at 17:44 | history | edited | YCor | CC BY-SA 4.0 |
removed capitals from title (the question was bumped anyway)
|
| Jan 1, 2021 at 1:49 | answer | added | Fedor Petrov | timeline score: 9 | |
| Aug 5, 2016 at 13:39 | answer | added | David E Speyer | timeline score: 18 | |
| Jul 13, 2013 at 6:45 | vote | accept | RandomStudent | ||
| Jul 1, 2013 at 4:04 | answer | added | Noam D. Elkies | timeline score: 21 | |
| Jun 25, 2013 at 3:02 | review | First posts | |||
| Jun 25, 2013 at 13:27 | |||||
| S Jun 16, 2013 at 13:26 | vote | accept | RandomStudent | ||
| Jul 13, 2013 at 6:45 | |||||
| Jun 16, 2013 at 13:18 | vote | accept | RandomStudent | ||
| S Jun 16, 2013 at 13:26 | |||||
| Jun 14, 2013 at 14:40 | answer | added | Noam D. Elkies | timeline score: 36 | |
| Jun 14, 2013 at 13:00 | comment | added | Johan Andersson | The simplest upper bound to prove is $4^n$ (which is still stronger than your bound) and just follows from the binomial expansion of $(1+1)^{2n}$. Peter's answer gives a less wasteful estimate. | |
| Jun 14, 2013 at 12:52 | vote | accept | RandomStudent | ||
| Jun 16, 2013 at 13:18 | |||||
| Jun 14, 2013 at 12:36 | answer | added | Péter Komjáth | timeline score: 22 | |
| Jun 14, 2013 at 10:26 | history | asked | RandomStudent | CC BY-SA 3.0 |