n_fq_bpoly_add, n_fq_bpoly_sub, n_fq_bpoly_mul, n_fq_bpoly_mul_series, n_fq_bpoly_divrem_series, n_fq_bpoly_divides, n_fq_bpoly_make_primitive
Synopsis
#include <flint/fq_nmod_mpoly_factor.h>void n_fq_bpoly_add(n_bpoly_t A, const n_bpoly_t B, const n_bpoly_t C, const fq_nmod_ctx_t ctx)sourcevoid n_fq_bpoly_sub(n_bpoly_t A, const n_bpoly_t B, const n_bpoly_t C, const fq_nmod_ctx_t ctx)sourcevoid n_fq_bpoly_mul(n_bpoly_t A, const n_bpoly_t B, const n_bpoly_t C, const fq_nmod_ctx_t ctx)sourcevoid n_fq_bpoly_mul_series(n_bpoly_t A, const n_bpoly_t B, const n_bpoly_t C, slong order, const fq_nmod_ctx_t ctx)sourcevoid n_fq_bpoly_divrem_series(n_bpoly_t Q, n_bpoly_t R, const n_bpoly_t A, const n_bpoly_t B, slong order, const fq_nmod_ctx_t ctx)sourceint n_fq_bpoly_divides(n_bpoly_t Q, const n_bpoly_t A, const n_bpoly_t B, const fq_nmod_ctx_t ctx)sourcevoid n_fq_bpoly_make_primitive(n_poly_t g, n_bpoly_t A, const fq_nmod_ctx_t ctx)sourceSum, difference and product; product and division with remainder with the inner variable truncated to order terms; exact division (returning 1 if exact); and removal of the content g (a polynomial in the inner variable).
Cite this page
The FLINT team, “n_fq_bpoly_add, n_fq_bpoly_sub, n_fq_bpoly_mul, n_fq_bpoly_mul_series, n_fq_bpoly_divrem_series, n_fq_bpoly_divides, n_fq_bpoly_make_primitive (fq_nmod_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_mpoly_factor/n_fq_bpoly_add.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-mpoly-factor-n-fq-bpoly-add,
author = {{The FLINT team}},
title = {{n\_fq\_bpoly\_add, n\_fq\_bpoly\_sub, n\_fq\_bpoly\_mul, n\_fq\_bpoly\_mul\_series, n\_fq\_bpoly\_divrem\_series, n\_fq\_bpoly\_divides, n\_fq\_bpoly\_make\_primitive (fq\_nmod\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_mpoly_factor/n_fq_bpoly_add.html},
note = {Generated 2026-10-20}
}