Representation of <sup>n</sup>√D<sup>n</sup> — d as a Periodic Continued Fraction by Jacobi's Algorithm (Q5509052)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Representation of n√Dn — d as a Periodic Continued Fraction by Jacobi's Algorithm |
scientific article; zbMATH DE number 3220439
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Representation of <sup>n</sup>√D<sup>n</sup> — d as a Periodic Continued Fraction by Jacobi's Algorithm |
scientific article; zbMATH DE number 3220439 |
Statements
Representation of <sup>n</sup>√D<sup>n</sup> — d as a Periodic Continued Fraction by Jacobi's Algorithm (English)
0 references
1965
0 references
number theory
0 references
