2000 character limit reached
The fastest possible continued fraction approximations of a class of functions
Published 1 Aug 2015 in math.CA | (1508.00176v1)
Abstract: The goal of this paper is to formulate a systematical method for constructing the fastest possible continued fraction approximations of a class of functions. The main tools are the multiple-correction method, the generalized Mortici's lemma and the Mortici-transformation. As applications, we will present some sharp inequalities, and the continued fraction expansions associated to the volume of the unit ball. In addition, we obtain a new continued fraction expansion of Ramanujan for a ratio of the gamma functions, which is showed to be the fastest possible. Finally, three conjectures are proposed.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.