FLINT3.7.0-dev

qfb_exponent_grh

Synopsis#include <flint/qfb.h>
int qfb_exponent_grh(fmpz_t exponent, fmpz_t n, ulong B1, ulong B2_sqrt)source

As qfb_exponent, but uses the prime forms of all primes p < 6 \log^2 |n| that split or ramify. Assuming the generalised Riemann hypothesis, these generate the class group [Bach1990], [BD1992], so the result is the exponent of the class group if the function returns 1.

Guides#

References#

  • [Bach1990] E. Bach, "Explicit bounds for primality testing and related problems", Mathematics of Computation 55 (1990), 355–380. https://doi.org/10.1090/S0025-5718-1990-1023756-8
  • [BD1992] D. Buchmann and S. Düllmann. "Distributed class group computation." Informatik: Festschrift zum 60. Geburtstag von Günter Hotz (1992): 69-79.
Cite this page

The FLINT team, “qfb_exponent_grh (qfb.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qfb/qfb_exponent_grh.html (generated 2026-10-20).