The restricted Nagata's pairwise algorithm and the Euclidean algorithm (Q953942): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:46, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The restricted Nagata's pairwise algorithm and the Euclidean algorithm |
scientific article |
Statements
The restricted Nagata's pairwise algorithm and the Euclidean algorithm (English)
0 references
7 November 2008
0 references
\textit{M. Nagata} introduced [in: Algebraic geometry seminar. Proceedings of the seminar, Singapore, November 3--6, 1987. Singapore: World Scientific, 69--74 (1988; Zbl 0947.14500)] a generalization of the Euclidean algorithm. The author presents a modification of this algorithm, develops its properties and shows that if this algorithm exists in a ring of integers of a quadratic number field \(Q(\sqrt{-d})\), then \(d=1,2,3,7\) or \(11\).
0 references
Euclidean algorithm
0 references
