_fq_nmod_poly_rem, fq_nmod_poly_rem
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_rem(fq_nmod_struct * R, const fq_nmod_struct * A, slong lenA, const fq_nmod_struct * B, slong lenB, const fq_nmod_t invB, const fq_nmod_ctx_t ctx)void fq_nmod_poly_rem(fq_nmod_poly_t R, const fq_nmod_poly_t A, const fq_nmod_poly_t B, const fq_nmod_ctx_t ctx)Compute only the remainder R of the division of A by B \ne 0. The underscore version writes lenB - 1 coefficients and also accepts lenA < lenB; invB is not used.
Generated from the same template as _fq_poly_rem, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_rem, fq_nmod_poly_rem (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_rem.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-rem,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_rem, fq\_nmod\_poly\_rem (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_rem.html},
note = {Generated 2026-10-20}
}