Kevin O'Bryant
Reputation
6,924
Next privilege 10,000 Rep.
Access moderator tools
 7h awarded Good Answer 1d comment Are there good bounds on binomial coefficients? @kodlu It does, I'm sure, but I haven't gotten back to that application just yet. But it is definitely the type of result I was missing. 1d accepted Are there good bounds on binomial coefficients? Apr 19 comment Are there good bounds on binomial coefficients? Stirling's formula is indeed awesome, but it leaves one with $k^k$ and $(n-k)^{n-k}$ factors which are too cumbersome to work with in my application. Apr 18 awarded Nice Question Apr 18 asked Are there good bounds on binomial coefficients? Apr 17 awarded Custodian Apr 17 reviewed Close Is the set of Cauchy spaces a lattice? Apr 17 reviewed Leave Open Optimization with vectors Apr 17 comment Estimate of incomplete binomial integral No, they don't seem relevant to me, either. But my first step was to track it down and see what was there. I posted the link for the convenience of the next reader. Apr 17 comment Estimate of incomplete binomial integral The integral is $B_{k/(n+1)}(k+1,n-k+1)$, in the notation of the Wolfram site. Various transformations and identities (though nothing obviously relevant) are cataloged here: functions.wolfram.com/GammaBetaErf/Beta3 Apr 17 revised What is the smallest x such that [x^n] has the same parity as n? updated report of computations. Apr 17 comment On the parity of $[x^n]$ Is the parenthetical comment supposed to be obvious? It's clear to me that we can start with any finite binary sequence, but the $x$ that satisfy the first $n$ constraints'', while nonempty for each $n$, may have empty intersection, as far as I can tell. Apr 17 comment On the parity of $[x^n]$ Every element of $(-1,0)$ has this property. Apr 17 answered What is the smallest x such that [x^n] has the same parity as n? Mar 19 awarded Nice Answer Mar 7 awarded Good Answer Feb 24 awarded Good Answer Dec 31 comment Pade approximant to exponential function (i) is immediate, the others (if true) would seem to require some work. Oct 29 awarded Nice Answer