FLINT3.7.0-dev
/

arb_pow_ui, arb_pow_fmpz, arb_pow_fmpz_binexp, arb_ui_pow_ui, arb_si_pow_ui

Synopsis#include <flint/arb.h>
void arb_pow_ui(arb_t y, const arb_t b, ulong e, slong prec)source
void arb_pow_fmpz(arb_t y, const arb_t b, const fmpz_t e, slong prec)source
void arb_pow_fmpz_binexp(arb_t y, const arb_t b, const fmpz_t e, slong prec)source
void arb_ui_pow_ui(arb_t y, ulong b, ulong e, slong prec)source
void arb_si_pow_ui(arb_t y, slong b, ulong e, slong prec)source

Set y to b^e by binary exponentiation, with an initial inversion if e < 0. With exact b and e \ge 0, prec may be ARF_PREC_EXACT to get the exact power if it fits in memory.

The cost grows with the size of e; for huge exponents, arb_pow (which uses \exp(e \log b)) can be much faster.

Cite this page

The FLINT team, “arb_pow_ui, arb_pow_fmpz, arb_pow_fmpz_binexp, arb_ui_pow_ui, arb_si_pow_ui (arb.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arb/arb_pow_ui.html (generated 2026-10-20).