There are exactly 21 quadratic fields whose rings of integers admit a Euclidean algorithm
using
as the Euclidean function for . They are for squarefreeintegers,,,,, 2, 3, 5, 6, 7, 11, 13, 17,
19, 21, 29, 33, 37, 41, 57, and 73 (OEIS A048981).
This list was published by Inkeri (1947), but erroneously included the spurious additional
term 97 (Barnes and Swinnerton-Dyer 1952; Hardy and Wright 1979, p. 217).
Barnes, E. S. and Swinnerton-Dyer, H. P. F. "The Inhomogeneous Minima of Binary Quadratic Forms. I." Acta Math87,
259-323, 1952.Berg, E. Fysiogr. Sällsk. Lund. Föhr.5,
1-6, 1935.Chatland, H. "On the Euclidean Algorithm in Quadratic
Number Fields." Bull. Amer. Math. Soc.55, 948-953, 1949.Chatland,
H. and Davenport, H. "Euclid's Algorithm in Real Quadratic Fields." Canad.
J. Math.2, 289-296, 1950.Hardy, G. H. and Wright, E. M.
"Real Euclidean Fields" and "Real Euclidean Fields (Continued)."
§14.8 and 14.9 in An
Introduction to the Theory of Numbers, 5th ed. Oxford, England: Clarendon
Press, pp. 213-217, 1979.Inkeri, K. "Über den Euklidischen
Algorithmus in quadratischen Zahlkörpern." Ann. Acad. Sci. Fennicae
Ser. A. 1. Math.-Phys., No. 41, 1-35, 1947.Koch, H. "Quadratic
Number Fields." Ch. 9 in Number
Theory: Algebraic Numbers and Functions. Providence, RI: Amer. Math. Soc.,
pp. 275-314, 2000.LeVeque, W. J. Topics
in Number Theory, Vol. 2. Reading, MA: Addison-Wesley, p. 57, 1956.Oppenheim.
Math. Ann.109, 349-352, 1934.Samuel, P. "Unique
Factorization." Amer. Math. Monthly75, 945-952, 1968.Shanks,
D. Solved
and Unsolved Problems in Number Theory, 4th ed. New York: Chelsea, pp. 153-154,
1993.Sloane, N. J. A. Sequence A048981
in "The On-Line Encyclopedia of Integer Sequences."Stark,
H. M. An
Introduction to Number Theory. Cambridge, MA: MIT Press, p. 294, 1994.