_fmpz_factor_smooth
Synopsis
#include <flint/fmpz_factor.h>int _fmpz_factor_smooth(fmpz_factor_t factor, const fmpz_t n, slong bits, int proved, int adaptive)sourcefmpz_factor_smooth (which calls this with adaptive = 0). If adaptive is nonzero, the bound bits is lowered whenever the unfactored part gets smaller (after trial division and after each factor found by the elliptic curve method) to the bound that fmpz_factor_no_trial would choose for a number of that size, so that the search stops once finishing the cofactor with the quadratic sieve is expected to be faster. This is used by fmpz_factor_no_trial.
Cite this page
The FLINT team, “_fmpz_factor_smooth (fmpz_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_factor/_fmpz_factor_smooth.html (generated 2026-10-20).
@misc{flint-doc-fmpz-factor-fmpz-factor-smooth,
author = {{The FLINT team}},
title = {{\_fmpz\_factor\_smooth (fmpz\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_factor/_fmpz_factor_smooth.html},
note = {Generated 2026-10-20}
}