The Euclidean algorithm
From MaRDI portal
Publication:5793391
DOI10.1090/S0002-9904-1949-09344-8zbMath0035.30302WikidataQ56047899 ScholiaQ56047899MaRDI QIDQ5793391
Publication date: 1949
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Related Items
Gow-Tamburini type generation of \(\mathrm{SL}_3(R)\) over the rings of integers of imaginary quadratic number fields of class number one ⋮ Generalized Gröbner bases: Theory and applications. A condensation ⋮ Unnamed Item ⋮ On the D-bases of polynomial ideals over principal ideal domains ⋮ Suggested Corrections for “A Principal Ideal Domain That Is Not a Euclidean Domain” ⋮ The 2-stage Euclidean algorithm and the restricted Nagata's pairwise algorithm ⋮ Euclidean algorithm in Galois quartic fields ⋮ On Euclidean ideal classes in certain abelian extensions ⋮ Lenstra-Hurwitz cliques and the class number one problem ⋮ Growth results and Euclidean ideals ⋮ Integrally Closed Subrings of an Integral Domain ⋮ A Survey of Certain Euclidean Number Fields ⋮ A remark on the ring of algebraic integers in \(\mathbb{Q}(\sqrt {- d})\) ⋮ The restricted Nagata's pairwise algorithm and the Euclidean algorithm ⋮ EUCLIDEAN TOTALLY DEFINITE QUATERNION FIELDS OVER THE RATIONAL FIELD AND OVER QUADRATIC NUMBER FIELDS ⋮ Rabinowitsch times six ⋮ On a proposition of Samuel and 2-stage Euclidean algorithm in global fields ⋮ Transfinitely valued Euclidean domains have arbitrary indecomposable order type ⋮ Some arithmetic properties of subrings of function fields over finite fields ⋮ Left Euclidean (2, 2)-Algebras ⋮ Products of idempotent matrices over integral domains ⋮ On the divisibility of matrices with remainder over the domain of principal ideals ⋮ About Euclidean rings ⋮ Recursive properties of Euclidean domains ⋮ The minimal Euclidean function on the Gaussian integers ⋮ A note on Euclidean order types ⋮ Euclid's algorithm in global fields
Cites Work
