qsieve_init_A
Synopsis
#include <flint/qsieve.h>Chooses the number s of prime factors of A and the range of the factor base from which they are taken (primes of about (\log_2 A)/s bits, following msieve), allocates the polynomial data and computes the first A. Returns 0 if no suitable range exists, in which case the factor base must be extended.
Cite this page
The FLINT team, “qsieve_init_A (qsieve.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qsieve/qsieve_init_A.html (generated 2026-10-20).
@misc{flint-doc-qsieve-qsieve-init-A,
author = {{The FLINT team}},
title = {{qsieve\_init\_A (qsieve.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/qsieve/qsieve_init_A.html},
note = {Generated 2026-10-20}
}