A simple algorithm for expanding a power series as a continued fraction
Abstract
I present and discuss an extremely simple algorithm for expanding a formal power series as a continued fraction. This algorithm, which goes back to Euler (1746) and Viscovatov (1805), deserves to be better known. I also discuss the connection of this algorithm with the work of Gauss (1812), Stieltjes (1889), Rogers (1907) and Ramanujan, and a combinatorial interpretation based on the work of Flajolet (1980).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.