2000 character limit reached
On the complexity of p-adic continued fractions of rational number
Published 23 May 2024 in math.NT | (2405.14500v2)
Abstract: In this paper, we study the complexity of p-adic continued fractions of a rational number, which is the p-adic analogue of the theorem of Lame. We calculate the length of Browkin expansion, and the length of Schneider expansion. Also, some numerical examples have been given.
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.