Representation of <sup>n</sup>√D<sup>n</sup> — d as a Periodic Continued Fraction by Jacobi's Algorithm (Q5509052): Difference between revisions
From MaRDI portal
Set profile property. |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:10, 7 March 2024
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
