fmpz_mpoly_pow_ui, fmpz_mpoly_pow_fmpz
Synopsis
#include <flint/fmpz_mpoly.h>int fmpz_mpoly_pow_ui(fmpz_mpoly_t A, const fmpz_mpoly_t B, ulong k, const fmpz_mpoly_ctx_t ctx)sourceint fmpz_mpoly_pow_fmpz(fmpz_mpoly_t A, const fmpz_mpoly_t B, const fmpz_t k, const fmpz_mpoly_ctx_t ctx)sourceSet A to B^k and return 1, or return 0 if the result would be unreasonably large. For k \ge 3 the power is computed by the Monagan–Pearce FPS algorithm (fmpz_mpoly_pow_fps); squares are computed by multiplication. fmpz_mpoly_pow_ui fails when k (\mathit{len}(B) - 1) exceeds about WORD_MAX/16. fmpz_mpoly_pow_fmpz throws for negative k, and for k that does not fit an slong succeeds only if B is zero or a monomial with coefficient \pm 1.
Guides#
Cite this page
The FLINT team, “fmpz_mpoly_pow_ui, fmpz_mpoly_pow_fmpz (fmpz_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly/fmpz_mpoly_pow_ui.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-fmpz-mpoly-pow-ui,
author = {{The FLINT team}},
title = {{fmpz\_mpoly\_pow\_ui, fmpz\_mpoly\_pow\_fmpz (fmpz\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mpoly/fmpz_mpoly_pow_ui.html},
note = {Generated 2026-10-20}
}