Asymptotic approximation of central binomial coefficients with rigorous error bounds
Keyword(s):
We show that a well-known asymptotic series for the logarithm of the central binomial coefficient is strictly enveloping in the sense of Pólya and Szegö, so the error incurred in truncating the series is of the same sign as the next term, and is bounded in magnitude by that term. We consider closely related asymptotic series for Binet's function, for \(\ln\Gamma(z+\frac12)\), and for the Riemann-Siegel theta function, and make some historical remarks.
Keyword(s):
2008 ◽
Vol 46
(1)
◽
pp. 180-200
◽
Keyword(s):
2017 ◽
Vol 44
(2)
◽
pp. 1-27
◽
1979 ◽
Vol 26
(2)
◽
pp. 2691-2692
◽
Keyword(s):
2014 ◽
Vol 46
(6)
◽
pp. 3782-3813
◽
Keyword(s):
2017 ◽
Vol 375
(2100)
◽
pp. 20160299
◽
1999 ◽
Vol 111
(1-2)
◽
pp. 13-24
◽