_nmod_poly_power_sums_naive, nmod_poly_power_sums_naive, _nmod_poly_power_sums_schoenhage, nmod_poly_power_sums_schoenhage
Synopsis
#include <flint/nmod_poly.h>void nmod_poly_power_sums_naive(nmod_poly_t res, const nmod_poly_t poly, slong n)sourcevoid _nmod_poly_power_sums_schoenhage(nn_ptr res, nn_srcptr poly, slong len, slong n, nmod_t mod)sourcevoid nmod_poly_power_sums_schoenhage(nmod_poly_t res, const nmod_poly_t poly, slong n)sourceThe power sums by Newton's identities, in O(n \cdot \mathit{len}) operations, and by the series formula with one power series division, in O(M(n)) operations. The underscore versions require poly monic.
Cite this page
The FLINT team, “_nmod_poly_power_sums_naive, nmod_poly_power_sums_naive, _nmod_poly_power_sums_schoenhage, nmod_poly_power_sums_schoenhage (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_naive.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-nmod-poly-power-sums-naive,
author = {{The FLINT team}},
title = {{\_nmod\_poly\_power\_sums\_naive, nmod\_poly\_power\_sums\_naive, \_nmod\_poly\_power\_sums\_schoenhage, nmod\_poly\_power\_sums\_schoenhage (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_naive.html},
note = {Generated 2026-10-20}
}