A characterization of real quadratic numbers by diophantine algorithms (Q1192423): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3836/tjm/1270130370 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1977633000 / rank | |||
Normal rank |
Revision as of 22:12, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A characterization of real quadratic numbers by diophantine algorithms |
scientific article |
Statements
A characterization of real quadratic numbers by diophantine algorithms (English)
0 references
27 September 1992
0 references
A 2-dimensional map \(T\) of continued fraction type is introduced which exhibits the following remarkable property: Let \(\alpha\) be a quadratic irrational number. Then \(\beta\in\mathbb{Q}(\alpha)\) if and only if \((\alpha,\beta)\) eventually becomes periodic under iteration of \(T\). The proof combines the old idea of a reduced quadratic irrational number with a suitable choice of a natural extension of \(T\). This result is similar to the findings on Morimoto's algorithm [\textit{Sh. Ito} and \textit{K. Kasahara}, Tokyo J. Math. 14, No. 2, 357-393 (1991); see the following review].
0 references
2-dimensional map
0 references
continued fraction
0 references
quadratic irrational number
0 references