_fq_zech_poly_div_newton_n_preinv, fq_zech_poly_div_newton_n_preinv
Synopsis
#include <flint/fq_zech_poly.h>void _fq_zech_poly_div_newton_n_preinv(fq_zech_struct * Q, const fq_zech_struct * A, slong lenA, const fq_zech_struct * B, slong lenB, const fq_zech_struct * Binv, slong lenBinv, const fq_zech_ctx_t ctx)void fq_zech_poly_div_newton_n_preinv(fq_zech_poly_t Q, const fq_zech_poly_t A, const fq_zech_poly_t B, const fq_zech_poly_t Binv, const fq_zech_ctx_t ctx)Compute the quotient of by with two multiplications, given the inverse Binv of the reversal of modulo : the reversed quotient is the product of the reversal of and Binv modulo . Requires ; the underscore version writes lenA - lenB + 1 coefficients and does not read . The non-underscore version throws FLINT_DIVZERO for .
Generated from the same template as _fq_poly_div_newton_n_preinv, whose documentation has the details.
Cite this page
The FLINT team, “_fq_zech_poly_div_newton_n_preinv, fq_zech_poly_div_newton_n_preinv (fq_zech_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_zech_poly/_fq_zech_poly_div_newton_n_preinv.html (generated 2026-11-02).
@misc{flint-doc-fq-zech-poly-fq-zech-poly-div-newton-n-preinv,
author = {{The FLINT team}},
title = {{\_fq\_zech\_poly\_div\_newton\_n\_preinv, fq\_zech\_poly\_div\_newton\_n\_preinv (fq\_zech\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_zech_poly/_fq_zech_poly_div_newton_n_preinv.html},
note = {Generated 2026-11-02}
}