Timeline for Is there an asymptotic formula for an inverse function of the binomial coefficient?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 27, 2013 at 17:14 | history | edited | Vidit Nanda | CC BY-SA 3.0 |
fixed 1 + ... + k = k(k+1)/2
|
| Sep 27, 2013 at 17:07 | history | edited | Vidit Nanda | CC BY-SA 3.0 |
Asymptotics on the product...
|
| Sep 27, 2013 at 16:53 | comment | added | user2529 | Thank you Vidit. Your computation gives a lower bound for $n_0(\epsilon)$. But this lower bound may not be sharp asymptotically in $\epsilon$. | |
| Sep 27, 2013 at 16:15 | history | answered | Vidit Nanda | CC BY-SA 3.0 |