Nagoya Mathematical Journal · 1980 · 20 citations · 0 references
Natural SciencesMathematicsAlgebraGeometryNumber TheoryArithmetic GeometryEuclidean AlgorithmNumber-theoretic AlgorithmsClass Number ComputationClass Number FormulasPrimes In Class FieldsQuadratic Fields
G. Rabinowitsch [3] generalized the concept of the Euclidean algorithm and proved a theorem on a criterion in order that the class number of an imaginary quadratic number field is equal to one: Theorem. It is necessary and sufficient for the class number of an imaginary quadratic number field D = 1 — 4 m, m > 0, to be one that x 2 — x + m is prime for any integer x such that 1 ≤ x ≤ m — 2.