`_fmpz_poly_reduce`

Synopsis#include <flint/qadic.h>

void _fmpz_poly_reduce(fmpz * R, slong lenR, const fmpz * a, const slong * j, slong len)source

Reduces (R, lenR) in place modulo the sparse monic polynomial $f = \sum_k a_k X^{j_k}$ of degree $d = j_{\mathtt{len} - 1}$ , setting the coefficients of degree at least $d$ to zero. The array $j$ must be increasing; (R, lenR) may have leading zeros.

Cite this page

The FLINT team, “_fmpz_poly_reduce (qadic.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qadic/_fmpz_poly_reduce.html (generated 2026-11-02).

@misc{flint-doc-qadic-fmpz-poly-reduce,
  author       = {{The FLINT team}},
  title        = {{\_fmpz\_poly\_reduce (qadic.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/qadic/_fmpz_poly_reduce.html},
  note         = {Generated 2026-11-02}
}

Edit this page · PDF version · Built with fdoc from 0a4634bf95