Theoretical analysis uncovers finite bounds for generalized Euclidean quadratic orders, indicating strict limits on division algorithms in number rings.
Following Johnson, Queen, and Sevilla, we call an order O O in a number field K if, for all α ,β ∈ O α , β ∈ O with β ≠ 0 β ≠ 0 for which α O+β O α O + β O is a principal ideal of O O , there are γ , ρ ∈ O γ , ρ ∈ O with α =β γ + ρ α = β γ + ρ and |NK/Q(ρ )| < |NK/Q(β )| | N K / Q ( ρ ) | < | N K / Q ( β ) | . We prove that only finitely many quadratic orders are generalized Euclidean. Additionally, assuming GRH, we show that for each fixed $$d > 1,$$ d > 1 , there are only finitely many integers m for which Tᵈ-m T d - m is irreducible over Q Q and Z[m1/d] = Z[T]/(Tᵈ-m) Z [ m 1 / d ] = Z [ <
No takes yet. Share an insight, caveat, or question.
Adajar et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: