_nmod_poly_power_sums, nmod_poly_power_sums
Synopsis
#include <flint/nmod_poly.h>void nmod_poly_power_sums(nmod_poly_t res, const nmod_poly_t poly, slong n)sourceSet res to \sum_{k=0}^{n-1} p_k x^k. The non-underscore version accepts any nonzero poly with invertible leading coefficient (throwing FLINT_ERROR for zero) and handles factors x^k. The underscore version requires poly monic and writes n coefficients. Uses Newton's identities for 10 n < \mathit{len} + 75 and the series formula otherwise.
Cite this page
The FLINT team, “_nmod_poly_power_sums, nmod_poly_power_sums (nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_poly/_nmod_poly_power_sums.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-nmod-poly-power-sums,
author = {{The FLINT team}},
title = {{\_nmod\_poly\_power\_sums, nmod\_poly\_power\_sums (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_power_sums.html},
note = {Generated 2026-10-20}
}