qsieve_init_poly_first
Synopsis
#include <flint/qsieve.h>For the current A, computes the data for generating the values of B (for each prime q_i \mid A, the term B_i = (A/q_i) \gamma_i with \gamma_i \equiv \sqrt{kn} (A/q_i)^{-1} \pmod{q_i}, and 2 B_i A^{-1} \bmod p for every factor base prime p), the first B and the sieve start positions (\pm \sqrt{kn} - B) A^{-1} \bmod p for every factor base prime.
Cite this page
The FLINT team, “qsieve_init_poly_first (qsieve.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qsieve/qsieve_init_poly_first.html (generated 2026-10-20).
@misc{flint-doc-qsieve-qsieve-init-poly-first,
author = {{The FLINT team}},
title = {{qsieve\_init\_poly\_first (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_poly_first.html},
note = {Generated 2026-10-20}
}