Papers › A new algorithm for p-adic continued fractions
A new algorithm for p-adic continued fractions
Nadir Murru, Giuliano Romeo
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Continued fractions in the field of p--adic numbers have been recently studied by several authors. It is known that the real continued fraction of a positive quadratic irrational is eventually periodic (Lagrange's Theorem). It is still not known if a p--adic continued fraction algorithm exists that shares a similar property. In this paper we modify and improve one of Browkin's algorithms. This algorithm is considered one of the best at the present time. Our new algorithm shows better properties of periodicity. We show for the square root of integers that if our algorithm produces a periodic expansion, then this periodic expansion will have pre-period one. It appears experimentally that our algorithm produces more periodic continued fractions for quadratic irrationals than Browkin's algorithm. Hence, it is closer to an algorithm to which an analogue of Lagrange's Theorem would apply.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections