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
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/mana.19650290305 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/mana.19650290305 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991573718 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/MANA.19650290305 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:07, 30 December 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
