✦ LIBER ✦

Note on the Euclidean Algorithm

✍ Scribed by Erdos, P.; Ko, C.

Book ID: 120100141
Publisher: Oxford University Press
Year: 1938
Tongue: English
Weight: 150 KB
Volume: s1-13
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s1-13.1.3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] WALC

[Lecture Notes in Computer Science] WALCOM: Algorithms and Computation Volume 5431 || On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem

✍ Das, Sandip; Uehara, Ryuhei 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 481 KB

The non-Euclidean Euclidean algorithm

✍ Gilman, Jane 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Remark on the Euclidean Algorithm

✍ Bochner, S. 📂 Article 📅 1934 🏛 Oxford University Press 🌐 English ⚖ 36 KB

A note on Euclidean domains

✍ Nymann, J.E. 📂 Article 📅 1984 🏛 Taylor and Francis Group 🌐 English ⚖ 125 KB

On Radix Representation and the Euclidea

On Radix Representation and the Euclidean Algorithm

✍ Andrews, George E. 📂 Article 📅 1969 🏛 Mathematical Association of America 🌐 English ⚖ 364 KB

On the asymptotic analysis of the Euclid

On the asymptotic analysis of the Euclidean algorithm

✍ G.H. Norton 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Let N > 2 and 8 > 0. For uniformly distributed integers in the interval I-1, N], the Euclidean algorithm requires an average of 121n2( 1 divisions, where C is Porter's constant.