A Computational Technique for Determining the Class Number of a Pure Cubic Field
- 1 April 1976
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 30 (134) , 312-323
- https://doi.org/10.2307/2005974
Abstract
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.
Keywords
This publication has 7 references indexed in Scilit:
- The Simplest Cubic FieldsMathematics of Computation, 1974
- On the 3-Rank of Quadratic Fields and the Euler ProductMathematics of Computation, 1974
- A Table of Complex Cubic FieldsBulletin of the London Mathematical Society, 1973
- Ranks of Sylow 3-subgroups of ideal class groups of certain cubic fieldsBulletin of the American Mathematical Society, 1973
- Pure cubic fields whose class numbers are multiples of threeJournal of Number Theory, 1971
- A rational genus, class number divisibility, and unit theory for pure cubic fieldsJournal of Number Theory, 1970
- A numerical study of Dedekind's cubic class number formulaJournal of Research of the National Bureau of Standards, 1957