FLINT3.7.0-dev
/

qsieve_init_poly_first

Synopsis#include <flint/qsieve.h>
void qsieve_init_poly_first(qs_t qs_inf)source

For the current AA, computes the data for generating the values of BB (for each prime qi∣Aq_i \mid A, the term Bi=(A/qi)γiB_i = (A/q_i) \gamma_i with γi≡kn(A/qi)−1(modqi)\gamma_i \equiv \sqrt{kn} (A/q_i)^{-1} \pmod{q_i}, and 2BiA−1 mod p2 B_i A^{-1} \bmod p for every factor base prime pp), the first BB and the sieve start positions (±kn−B)A−1 mod p(\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-11-02).