Abstract
We study the previously developed extension of the Engel expansion to the field of Formal Laurent series. We examine three separate aspects. First we consider the algorithm in relation to the work of Ramanujan. Second we show how the algorithm can be used to prove expansions such as those found by Euler, Rogers, and Ramanujan. Finally we remark briefly on its use in acceleration of convergence.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
