On the Lack of an Euclidean Algorithm in R(√61)
From MaRDI portal
Publication:5840262
DOI10.2307/2371723zbMath0061.05904OpenAlexW2326640204MaRDI QIDQ5840262
Publication date: 1945
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2371723
Quadratic extensions (11R11) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items
The inhomogeneous minima of binary quadratic forms. I ⋮ Euclidean rings of algebraic numbers and functions ⋮ On the Euclidean algorithm in quadratic number fields