Algorithms define finiteness properties in P-adic continued fractions for number fields, suggesting new methods for division chains.
Let K be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for P P -adic continued fractions satisfying the finiteness property on K for every prime ideal P P of sufficiently large norm. This provides, in particular, a new algorithmic approach to the construction of division chains in number fields.
No takes yet. Share an insight, caveat, or question.
Capuano et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: