Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-14T10:10:56.122Z Has data issue: false hasContentIssue false
  • English
  • Français

Euclid's Algorithm in real Quadratic Fields

Published online by Cambridge University Press:  20 November 2018

H. Chatland and
H. Davenport
H. Chatland
Affiliation:
The Ohio State University and , University College, London
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

1. Let m be a positive square-free integer. Euclid's Algorithm is said to holdin the field if, given any non-integral element a in the field, an integera can be found so that

Information

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 2 , 1950, pp. 289 - 296
Copyright
Copyright © Canadian Mathematical Society 1950

References

[1] Davenport, H., Indefinite binary quadratic forms, and Euclid's Algorithm in real quadratic fields, Proc. London Math. Soc. (in course of publication).Google Scholar
[2] Chatland, H., On the Euclidean Algorithm in quadratic number fields, Bull. Amer. Math. Soc., vol. 55 (1949), 948–953.Google Scholar
[3] Erdös, P. and Ko, Chao, Note on the Euclidean Algorithm, J. London Math. Soc., vol. 13(1938), 3–8.Google Scholar
[4] K.|Inkeri, Über den Euklidischen Algorithmus in quadratischen Zahlkörpern, Annales Academiae Scientiarum Fennicae, vol. 41 (1947), 5–34.Google Scholar