For a real quadratic field whose ring of integers has class number 1, it is conjectured that is 2-stage Euclidean with respect to the norm: every pair of elements admits a division chain of length at most 2 ending with a norm-decreasing remainder. Cooke and Weinberger proved this in 1975, but only under the Generalized Riemann Hypothesis for Hecke -functions, and unconditional results cover only finite families — the largest verification (Guitart–Masdeu, 2013) handles all real quadratic class-number-one fields of discriminant below 8000. The open problem is an unconditional proof for all real quadratic fields of class number 1 in their natural generality, or an explicit counterexample (which would also refute GRH). Solving it is linked to the computation of continued fractions in these fields, since a 2-stage Euclidean structure yields an effective continued-fraction algorithm.
Background
A real quadratic field is for a squarefree integer ; its ring of integers consists of the algebraic integers in (the elements satisfying a monic polynomial with integer coefficients), and the norm multiplies an element by its conjugate under the nontrivial automorphism of . A domain is Euclidean (with respect to the norm) if for all there is a quotient with ; iterating gives the classical Euclidean algorithm, and every Euclidean ring is a principal ideal domain, so its class number (the number of ideal classes, measuring failure of unique factorization of ideals) is 1. Motzkin and Cooke weakened this: a -stage division chain for is a sequence of successive divisions , , , , and is 2-stage Euclidean (with respect to the norm) if every pair , , admits such a chain of length with final remainder satisfying . A 2-stage Euclidean field still has class number 1, and, by a proposition of Samuel studied further by Chen–Leu, 2-stage Euclideanity even implies Euclideanity with respect to a suitable (non-norm) function; the point is that the remainder need only become small after two steps, a strictly weaker requirement than norm-Euclideanity. Guitart and Masdeu reformulate the condition geometrically: is 2-stage Euclidean if and only if a fundamental domain for the lattice in (a region whose -translates tile the plane; its closure is compact) is covered by finitely many hyperbolic regions , bounded by hyperbolas, indexed by length-2 continued fractions with coefficients . Norm-Euclidean real quadratic fields form the small classical list (each field on the list is unconditionally norm-Euclidean; completeness of the list is known under GRH), while many more class-number-one fields are known to be 2-stage Euclidean case by case. The conjectural statement — that class number 1 and 2-stage Euclideanity coincide for real quadratic fields — was recorded in Lemmermeyer's 1995 survey and goes back to the weakening of the Euclidean property introduced by Motzkin and developed by Cooke. Its only general proof is conditional: Cooke and Weinberger showed in 1975 that the Generalized Riemann Hypothesis (GRH) for Hecke -functions — the -series, generalizing the Riemann zeta function, attached to ideal-class characters of number fields — implies that any number ring with infinitely many units and class number 1 admits such division chains (2-stage for real quadratic fields). Removing GRH from statements of this type is possible unconditionally only in higher unit rank (the unit rank of a number field being the number of multiplicatively independent fundamental units in its ring of integers): Harper and Murty (2004) proved unconditionally that Euclidean and principal ideal domain coincide for finite Galois extensions of with unit rank above 3, while real quadratic fields have unit rank 1 and are not covered. Clark (1996) removed GRH for totally real Galois extensions of degree at least 3, but for real quadratic fields his unconditional version requires an additional hypothesis — sufficiently many prime elements whose residue-class powers the unit group surjects onto — which has been verified only field by field. A further obstacle is that the quantifier 'every real quadratic field of class number 1' ranges over a family not known to be finite or infinite (it is believed infinite), so no finite computation can settle the general statement; and the algorithm of Guitart–Masdeu terminates exactly when the field is 2-stage Euclidean, so no current algorithm can certify in finite time that a field is not 2-stage Euclidean.
Problem Statement
Prove, without assuming the Generalized Riemann Hypothesis (GRH) or any other unproved hypothesis, that every real quadratic field (for squarefree ) of class number 1 — that is, whose ring of integers has trivial ideal class group — is 2-stage Euclidean with respect to the norm (the product of the two real conjugates of ): for all with there exist with , , and . Equivalently, that the hyperbolic regions , where is a length-2 continued fraction with coefficients , , cover a fundamental domain of the lattice in — for every such field, not merely for the finitely many fields of discriminant below 8000 already verified. Alternatively, disprove the conjecture by exhibiting a real quadratic field of class number 1 that is not 2-stage Euclidean (such a counterexample would also refute GRH for Hecke -functions, since the conjecture follows from GRH by Cooke–Weinberger).
References
- Xavier Guitart and Marc Masdeu, 'Continued fractions in 2-stage Euclidean quadratic fields', Mathematics of Computation 82 (2013), no. 282, 1223–1233. DOI: 10.1090/s0025-5718-2012-02620-2, https://doi.org/10.1090/s0025-5718-2012-02620-2 (preprint arXiv:1106.0856, https://arxiv.org/abs/1106.0856)
- George Cooke and Peter J. Weinberger, 'On the construction of division chains in algebraic number rings, with applications to SL₂', Communications in Algebra 3 (1975), no. 6, 481–524. DOI: 10.1080/00927877508822057, https://doi.org/10.1080/00927877508822057
- Franz Lemmermeyer, 'The Euclidean algorithm in algebraic number fields', Expositiones Mathematicae 13 (1995), no. 5, 385–416. zbMATH: https://zbmath.org/849120
- Jean-Paul Cerri, 'Some generalized Euclidean and 2-stage Euclidean number fields that are not norm-Euclidean', Mathematics of Computation 80 (2011), no. 276, 2289–2298. DOI: 10.1090/s0025-5718-2011-02468-3, https://doi.org/10.1090/s0025-5718-2011-02468-3
- David A. Clark, 'On k-stage Euclidean algorithms for Galois extensions of ℚ', Manuscripta Mathematica 90 (1996), no. 1, 149–153. DOI: 10.1007/BF02568300, https://doi.org/10.1007/BF02568300
- Malcolm Harper and M. Ram Murty, 'Euclidean rings of algebraic integers', Canadian Journal of Mathematics 56 (2004), no. 1, 71–76. DOI: 10.4153/CJM-2004-004-5, https://doi.org/10.4153/cjm-2004-004-5
- Ching-An Chen and Ming-Guang Leu, 'On a proposition of Samuel and 2-stage Euclidean algorithm in global fields', Journal of Number Theory 133 (2013), no. 1, 215–225. DOI: 10.1016/j.jnt.2012.07.009, https://doi.org/10.1016/j.jnt.2012.07.009
- M. Ram Murty, Kotyada Srinivas and Muthukrishnan Subramani, 'Admissible primes and Euclidean quadratic fields', Journal of the Ramanujan Mathematical Society 33 (2018), no. 2, 135–147. http://www.mathjournals.org/jrms/2018-033-002/2018-033-002-003.html
- François Morain, 'Division algorithms for norm-Euclidean real quadratic fields — part I', preprint (2026). arXiv:2602.06538, https://arxiv.org/abs/2602.06538