Mathematics of Computation · 1976 · 17 citations · 5 references
Natural SciencesComputer ScienceMathematicsCombinatoricsNumber TheoryTheory Of ComputationArithmetic GeometryCombinatorial Number TheoryComputational Number TheoryNumber-theoretic AlgorithmsClass Number ComputationClass Number Formulas
Two different computational techniques for determining the class number of a pure cubic field are discussed. These techniques were implemented on an IBM/370-158 computer, and the class number for each pure cubic field $Q({D^{1/3}})$ for $D = 2,3, \ldots ,9999$ was obtained. Several tables are presented which summarize the results of these computations. Some theorems concerning the class group structure of pure cubic fields are also given. The paper closes with some conjectures which were inspired by the computer results.
5
On the 3-Rank of Quadratic Fields and the Euler Product
Carol Neild, Daniel Shanks · Mathematics of Computation · 1974 · 14 citations