`_nmod_poly_power_sums_to_poly, nmod_poly_power_sums_to_poly`

Synopsis#include <flint/nmod_poly.h>

void _nmod_poly_power_sums_to_poly(nn_ptr res, nn_srcptr poly, slong len, nmod_t mod)source

void nmod_poly_power_sums_to_poly(nmod_poly_t res, const nmod_poly_t Q)source

Set res to the monic polynomial of degree $d = Q_0$ whose power sum series is $Q$ (modulo $x^{\mathit{len}}$ , the higher power sums being determined by $d$ of them). Requires $1, \ldots, d$ invertible modulo $n$ . For $Q = 0$ the result is 1. The underscore version writes $d + 1$ coefficients. Uses Newton's identities if $n \le 12$ or $d \le 10$ and the exponential formula $\tilde f = \exp(\int (d - Q)/x)$ otherwise.

Cite this page

The FLINT team, “_nmod_poly_power_sums_to_poly, nmod_poly_power_sums_to_poly (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_to_poly.html (generated 2026-11-02).

@misc{flint-doc-nmod-poly-nmod-poly-power-sums-to-poly,
  author       = {{The FLINT team}},
  title        = {{\_nmod\_poly\_power\_sums\_to\_poly, nmod\_poly\_power\_sums\_to\_poly (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_to_poly.html},
  note         = {Generated 2026-11-02}
}

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