compute_factor_base
Synopsis
#include <flint/qsieve.h>Extends the factor base to num_primes primes: the multiplier, 2, and the primes p for which kn is a nonzero square modulo p, with their inverses and the square roots of kn modulo p. If a prime dividing n is met, it is stored in small_factor and the extension stops. Returns the factor base.
Cite this page
The FLINT team, “compute_factor_base (qsieve.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qsieve/compute_factor_base.html (generated 2026-10-20).
@misc{flint-doc-qsieve-compute-factor-base,
author = {{The FLINT team}},
title = {{compute\_factor\_base (qsieve.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/qsieve/compute_factor_base.html},
note = {Generated 2026-10-20}
}