The restricted Nagata's pairwise algorithm and the Euclidean algorithm (Q953942)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5363233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The restricted Nagata's pairwise algorithm and the Euclidean algorithm |
scientific article; zbMATH DE number 5363233 |
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
0 references
0.8298956751823425
0 references
0.8272283673286438
0 references
0.8202332258224487
0 references
0.7615851759910583
0 references
