Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

On Gauss’s class number problems
HTML articles powered by AMS MathViewer

by Daniel Shanks PDF
Math. Comp. 23 (1969), 151-163 Request permission

Abstract:

Let $h$ be the class number of binary quadratic forms (in Gauss’s formulation). All negative determinants having some $h = 6n \pm 1$ can be determined constructively: for $h = 5$ there are four such determinants; for $h = 7$, six; for $h = 11$, four; and for $h = 13$, six. The distinction between class numbers for determinants and for discriminants is discussed and some data are given. The question of one class/genus for negative determinants is imbedded in the larger question of the existence of a determinant having a specific Abelian group as its composition group. All Abelian groups of order $< 25$ so exist, but the noncyclic groups of order 25, 49, and 121 do not occur. Positive determinants are treated by the same composition method. Although most positive primes of the form ${n^2} - 8$have $h = 1$, an interesting subset does not. A positive determinant of an odd exponent of irregularity also appears in the investigation. Gauss indicated that he could not find one.
References
  • Carl Friedrich Gauss, Disquisitiones arithmeticae, Yale University Press, New Haven, Conn.-London, 1966. Translated into English by Arthur A. Clarke, S. J. MR 0197380
  • S. Chowla, “Heilbronn’s class-number theorem,” Proc. Indian Acad. Sci. Sect. A, v. 1, 1934, pp. 74–76. C. F. Gauss, Untersuchungen über höhere Arithmetik, Chelsea, New York, 1965, (Reprint of Maser Translation). The English translation [1] is garbled here. MR 32 #5488.
  • Daniel Shanks, On the conjecture of Hardy & Littlewood concerning the number of primes of the form $n^{2}+a$, Math. Comp. 14 (1960), 320–332. MR 120203, DOI 10.1090/S0025-5718-1960-0120203-6
  • L. E. Dickson, Introduction to the Theory of Numbers, Univ. of Chicago Press, Chicago, 1929, Theorem 85, p. 111.
  • K. E. Kloss, Some number-theoretic calculations, J. Res. Nat. Bur. Standards Sect. B 69B (1965), 335–336. MR 190057, DOI 10.6028/jres.069B.035
  • H. J. Smith, Report on the Theory of Numbers, Chelsea, New York, 1964, reprint. L. E. Dickson, History of the Theory of Numbers, Vol. 3, Stechert, New York, 1934, reprint, Chapter V. Gordon Pall, “Note on irregular determinants,” J. London Math. Soc., v. 11, 1936, pp. 34–35.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 10.66
  • Retrieve articles in all journals with MSC: 10.66
Additional Information
  • © Copyright 1969 American Mathematical Society
  • Journal: Math. Comp. 23 (1969), 151-163
  • MSC: Primary 10.66
  • DOI: https://doi.org/10.1090/S0025-5718-1969-0262204-1
  • MathSciNet review: 0262204