
doi: 10.1007/bf02567617
The author uses earlier methods of \textit{E. S. Barnes} and \textit{H. P. F. Swinnerton-Dyer} [Acta Math. 87, 259-323 (1952; Zbl 0046.276)] to prove with the help of a computer that the ring \(\mathbb{Z}[ {{1+ \sqrt {69}} \over 2}]\) is Euclidean. This is the first example of a quadratic number field shown to be Euclidean but not norm-Euclidean.
Quadratic extensions, 510.mathematics, Euclidean quadratic field, Algebraic number theory computations, Multiplicative structure; Euclidean algorithm; greatest common divisors, Article
Quadratic extensions, 510.mathematics, Euclidean quadratic field, Algebraic number theory computations, Multiplicative structure; Euclidean algorithm; greatest common divisors, Article
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 12 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
