qsieve_primes_init, qsieve_primes_increment
Synopsis
#include <flint/qsieve.h>Compute the initial factor base (of fb_primes primes, plus ks_primes extra primes held in reserve), respectively extend it by delta primes when sieving has to continue with a larger factor base. Return a small prime factor of n if one is found, and 0 otherwise.
Cite this page
The FLINT team, “qsieve_primes_init, qsieve_primes_increment (qsieve.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qsieve/qsieve_primes_init.html (generated 2026-10-20).
@misc{flint-doc-qsieve-qsieve-primes-init,
author = {{The FLINT team}},
title = {{qsieve\_primes\_init, qsieve\_primes\_increment (qsieve.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/qsieve/qsieve_primes_init.html},
note = {Generated 2026-10-20}
}