_fmpz_poly_pow, fmpz_poly_pow
Synopsis
#include <flint/fmpz_poly.h>void fmpz_poly_pow(fmpz_poly_t res, const fmpz_poly_t poly, ulong e)sourceSet res to poly raised to the power e, with 0^0 = 1. The function uses repeated squaring and multiplication for e \le 4, the binomial theorem for binomials, the J. C. P. Miller recurrence (_fmpz_poly_pow_multinomial) for short polynomials with small coefficients compared to e, and binary exponentiation otherwise. The underscore version requires e > 0 and \mathit{len} > 0, writes e(\mathit{len} - 1) + 1 coefficients and does not allow aliasing.
Cite this page
The FLINT team, “_fmpz_poly_pow, fmpz_poly_pow (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/_fmpz_poly_pow.html (generated 2026-10-20).
@misc{flint-doc-fmpz-poly-fmpz-poly-pow,
author = {{The FLINT team}},
title = {{\_fmpz\_poly\_pow, fmpz\_poly\_pow (fmpz\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_poly/_fmpz_poly_pow.html},
note = {Generated 2026-10-20}
}