2003/01/01 by Herman te Riele, Hugh C. Williams · 1 citation
Mathematics · Computer Science · #Analytic Number Theory Research #Coding theory and cryptography #Algebraic Geometry and Number Theory #Mathematics #Modulo #Rational number #Conjecture #Combinatorics #Heuristics #Prime (order theory) #Integer (computer science) #Quadratic equation #Class number #Algebraic number field #Discrete mathematics #Computation #Constant (computer programming) #Field (mathematics) #Algorithm #Pure mathematics
paper · doi:10.1080/10586458.2003.10504715
openalex publication_date 2003/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
Let h(p) denote the class number of the real quadratic field formed by adjoining √P; where p is a prime, to the rationals. The Cohen-Lenstra heuristics suggest that the probability that h(p) = k (a given odd positive integer) is given by C w (k)/k, where C is an explicit constant and w(k) is an explicit arithmetic function. For example, we expect that about 75.45% of the values of h(p) are 1, 12.57% are 3, and 3.77% are 5. Furthermore, a conjecture of Hooley states that where the sum is taken over all primes congruent to 1 modulo 4. In this paper, we develop some fast techniques for evaluating h(p) where p is not very large and provide some computational results in support of the Cohen-Lenstra heuristics. We do this by computing h(p) for all p (≡ 1 mod 4) and p < 2. 1011. We also tabulate H(x) up to 2.1011.