Representation of n√Dn — d as a Periodic Continued Fraction by Jacobi's Algorithm
From MaRDI portal
Publication:5509052
DOI10.1002/mana.19650290305zbMath0136.03103OpenAlexW1991573718MaRDI QIDQ5509052
Publication date: 1965
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mana.19650290305
Related Items (2)
Units from periodic Jacobi-Perron algorithms in algebraic number fields of degree \(n > 2\) ⋮ A class of periodic Jacobi-Perron algorithms in pure algebraic number fields of degree \(n\geq 3\)
This page was built for publication: Representation of n√Dn — d as a Periodic Continued Fraction by Jacobi's Algorithm