_nmod_poly_integral, nmod_poly_integral
Synopsis
#include <flint/nmod_poly.h>void nmod_poly_integral(nmod_poly_t x_int, const nmod_poly_t x)sourceSet x_int to the integral of x with constant term 0. The integers 1, \ldots, \deg x + 1 must be invertible modulo n, for example n prime and n > \deg x + 1; otherwise FLINT_IMPINV is thrown. Here len is the length of the output: the underscore version reads \mathit{len} - 1 coefficients, writes len coefficients, requires \mathit{len} \ge 1 and allows x_int == x. It needs only one modular inversion.
Cite this page
The FLINT team, “_nmod_poly_integral, nmod_poly_integral (nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_poly/_nmod_poly_integral.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-nmod-poly-integral,
author = {{The FLINT team}},
title = {{\_nmod\_poly\_integral, nmod\_poly\_integral (nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_poly/_nmod_poly_integral.html},
note = {Generated 2026-10-20}
}