_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 if divides , and otherwise return 0 and set to zero. The leading coefficient of must be invertible. The underscore versions require and write coefficients.
The quotient is computed first, and the product is compared with 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 and .
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-11-02).
@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-11-02}
}