_fq_nmod_poly_divrem_f, fq_nmod_poly_divrem_f
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_divrem_f(fq_nmod_t f, fq_nmod_struct * Q, fq_nmod_struct * R, const fq_nmod_struct * A, slong lenA, const fq_nmod_struct * B, slong lenB, const fq_nmod_ctx_t ctx)void fq_nmod_poly_divrem_f(fq_nmod_t f, fq_nmod_poly_t Q, fq_nmod_poly_t R, const fq_nmod_poly_t A, const fq_nmod_poly_t B, const fq_nmod_ctx_t ctx)As fq_nmod_poly_divrem, for a possibly reducible defining polynomial: if the leading coefficient of B is invertible, sets f = 1 and computes Q and R; otherwise sets f to a nontrivial factor of the defining polynomial (see fq_nmod_gcdinv) and leaves Q and R unchanged. B must be nonzero.
Generated from the same template as _fq_poly_divrem_f, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_divrem_f, fq_nmod_poly_divrem_f (fq_nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_divrem_f.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-divrem-f,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_divrem\_f, fq\_nmod\_poly\_divrem\_f (fq\_nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_divrem_f.html},
note = {Generated 2026-10-20}
}