_fmpz_mod_poly_divides, fmpz_mod_poly_divides, _fmpz_mod_poly_divides_classical, fmpz_mod_poly_divides_classical
#include <flint/fmpz_mod_poly.h>int _fmpz_mod_poly_divides(fmpz * Q, const fmpz * A, slong lenA, const fmpz * B, slong lenB, const fmpz_mod_ctx_t ctx)sourceint fmpz_mod_poly_divides(fmpz_mod_poly_t Q, const fmpz_mod_poly_t A, const fmpz_mod_poly_t B, const fmpz_mod_ctx_t ctx)sourceint _fmpz_mod_poly_divides_classical(fmpz * Q, const fmpz * A, slong lenA, const fmpz * B, slong lenB, const fmpz_mod_ctx_t ctx)sourceint fmpz_mod_poly_divides_classical(fmpz_mod_poly_t Q, const fmpz_mod_poly_t A, const fmpz_mod_poly_t B, const fmpz_mod_ctx_t ctx)sourceReturn 1 and set Q = A/B if B divides A, and otherwise return 0 and set Q to zero. The leading coefficient of B must be invertible. The underscore versions require \mathit{lenA} \ge \mathit{lenB} > 0 and write \mathit{lenA} - \mathit{lenB} + 1 coefficients.
The quotient is computed first, and the product BQ is compared with A coefficient by coefficient from the bottom, so that a non-divisor is usually detected early; the classical version does the comparison with dot products and is used by fmpz_mod_poly_divides for \mathit{lenA} < 40 and \mathit{lenB} < 20.
The FLINT team, “_fmpz_mod_poly_divides, fmpz_mod_poly_divides, _fmpz_mod_poly_divides_classical, fmpz_mod_poly_divides_classical (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_divides.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-divides,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_divides, fmpz\_mod\_poly\_divides, \_fmpz\_mod\_poly\_divides\_classical, fmpz\_mod\_poly\_divides\_classical (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_divides.html},
note = {Generated 2026-10-20}
}