nmod_mpoly_pow_ui, nmod_mpoly_pow_fmpz
Synopsis
#include <flint/nmod_mpoly.h>int nmod_mpoly_pow_ui(nmod_mpoly_t A, const nmod_mpoly_t B, ulong k, const nmod_mpoly_ctx_t ctx)sourceint nmod_mpoly_pow_fmpz(nmod_mpoly_t A, const nmod_mpoly_t B, const fmpz_t k, const nmod_mpoly_ctx_t ctx)sourceSet A to B^k, with B^0 = 1 (zero if n = 1). nmod_mpoly_pow_fmpz throws if k < 0, and returns 0 (failure) if k does not fit an slong and B has more than one term; otherwise both return 1. For a prime modulus p \le 99999, nmod_mpoly_pow_ui writes k = \sum_j k_j p^j and uses B^{p^j} = B(x_0^{p^j}, \ldots), so that only the powers B^{k_j} with k_j < p are computed by repeated multiplication.
Guides#
Cite this page
The FLINT team, “nmod_mpoly_pow_ui, nmod_mpoly_pow_fmpz (nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly/nmod_mpoly_pow_ui.html (generated 2026-10-20).
@misc{flint-doc-nmod-mpoly-nmod-mpoly-pow-ui,
author = {{The FLINT team}},
title = {{nmod\_mpoly\_pow\_ui, nmod\_mpoly\_pow\_fmpz (nmod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_mpoly/nmod_mpoly_pow_ui.html},
note = {Generated 2026-10-20}
}