✦ LIBER ✦

On the Euclidean Algorithm in Real Quadratic Fields

✍ Scribed by Min, S.-H.

Book ID: 120099004
Publisher: Oxford University Press
Year: 1947
Tongue: English
Weight: 85 KB
Volume: s1-22
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s1-22.2.88

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Euclidean real quadratic number fields

✍ David H. Johnson; Clifford S. Queen; Alicia N. Sevilla 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 332 KB

The number of steps in the euclidean alg

The number of steps in the euclidean algorithm over complex quadratic fields

✍ Arnold Knopfmacher; John Knopfmacher 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 298 KB

Indefinite Binary Quadratic Forms, and E

Indefinite Binary Quadratic Forms, and Euclid's Algorithm in Real Quadratic Fields

✍ Davenport, H. 📂 Article 📅 1951 🏛 Oxford University Press 🌐 English ⚖ 403 KB

Indefinite Binary Quadratic Forms, and E

Indefinite Binary Quadratic Forms, and Euclid's Algorithm in Real Quadratic Fields

✍ Davenport, H. 📂 Article 📅 1951 🏛 Oxford University Press 🌐 English ⚖ 46 KB

On the Distribution of Quadratic Non-Res

On the Distribution of Quadratic Non-Residues and the Eucidean Algorithm in Real Quadratic Fields. II

✍ Loo-Keng Hua and Szu-Hoa Min 📂 Article 📅 1944 🏛 American Mathematical Society 🌐 English ⚖ 459 KB

On real quadratic function fields

✍ Erwan Le Yaouanc 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 126 KB

Let q be a power of an odd prime number p and K := F q (T ) be the rational function field with a fixed indeterminate T . For P a prime of K, let K + P be the maximal real subfield of the P th-cyclotomic function field and O K + P its ring of integers. We prove that there exists infinitely many prim