Improving the Speed of Calculating the Regulator of Certain Pure Cubic Fields
- 1 October 1980
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 35 (152) , 1423-1434
- https://doi.org/10.2307/2006408
Abstract
To calculate R, the regulator of a pure cubic field $Q(\sqrt [3]{{D)}}$, a complete period of Voronoi’s continued fraction algorithm over $Q(\sqrt [3]{{D)}}$ is usually generated. In this paper it is shown how, in certain pure cubic fields, R can be determined by generating only about one third of this period. These results were used on a computer to find R and then the class number for all pure cubic fields $Q(\sqrt [3]{{p)}}$, where p is a prime, $p \equiv - 1\;\pmod 3$, and $p < 2 \times {10^5}$. Graphs illustrating the distribution of such cubic fields with class number one are presented.
Keywords
This publication has 10 references indexed in Scilit:
- The Theory of Irrationalities of the Third DegreePublished by American Mathematical Society (AMS) ,2009
- Calculation of the Regulator of a Pure Cubic FieldMathematics of Computation, 1980
- A Note on Class-Number One in Pure Cubic FieldMathematics of Computation, 1979
- Calculation of the Regulator of Q(√D) by use of the Nearest Integer Continued Fraction AlgorithmMathematics of Computation, 1979
- Certain Pure Cubic Fields With Class-Number OneMathematics of Computation, 1977
- A Computational Technique for Determining the Class Number of a Pure Cubic FieldMathematics of Computation, 1976
- Computation of the Ideal Class Group of Certain Complex Quartic Fields. IIMathematics of Computation, 1975
- Remarks on principal factors in a relative cubic fieldJournal of Number Theory, 1971
- 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