On the periodicity of an algorithm for \(p\)-adic continued fractions (Q6046855): Difference between revisions

Let \(p\) be an odd prime. Let \(\nu_p(\cdot)\) and \(|\cdot|_p\) be the \(p\)-adic valuation and the \(p\)-adic absolute value over \(\mathbb{Q}\). A continued fraction of a value \(\alpha\) notated as \[ \alpha=[b_0,b_1,b_2,\ldots]. \] A two Browkin algorithms for expansion \(\alpha \in \mathbb{Q}_p\) into a \(p\)-adic continued fraction are well known. The periodicity properties of Browkin's first algorithm are well-studied. The periodicity properties of Browkin's first algorithm are well-studied. This paper studies the periodicity properties of second Browkin's \(p\)-adic continued fractions. An analogue of the Galois theorem for classical continued fractions obtained in the paper. The length of the preperiod for periodic expansions of square roots investigated. It proved that there exist infinitely many square roots of integers in \(\mathbb{Q}_p\) that have a periodic expansion with the period of length 4. This is solving an open problem left by Browkin.