_mp_real_exp_fp, _mp_real_exp_fp_huge, _mp_real_expm1_fp, _mp_real_exp2_fp
#include <flint/mp_real.h>slong _mp_real_exp_fp(nn_ptr y, ulong * err, nn_srcptr d, slong n, slong e, int sgnbit, slong pb)sourceint _mp_real_exp_fp_huge(nn_ptr y, ulong * err, nn_ptr q, slong * qn, nn_srcptr d, slong n, slong e, int sgnbit, slong pb)sourceslong _mp_real_expm1_fp(nn_ptr y, ulong * elo, ulong * ehi, nn_srcptr d, slong n, slong e, int sgnbit, slong pb)sourceslong _mp_real_exp2_fp(nn_ptr y, ulong * err, nn_srcptr d, slong n, slong e, int sgnbit, slong pb)sourceThe exponential of with MP_REAL_EXP_FP_MAX_EXP : sets (y needs nk + 2 limbs) and err, and returns with within err units; lies in except on the paths with for . The reduction uses the tabulated at nk + 1 limbs. For larger exponents, _mp_real_exp_fp_huge returns the binary shift as the bignum , q needing limbs, at the cost of two products of about bits. _mp_real_expm1_fp returns with separate lower and upper error counts, with for , where the result keeps its relative accuracy when the caller adds bits to pb. _mp_real_exp2_fp is , exact for an integer .
The FLINT team, “_mp_real_exp_fp, _mp_real_exp_fp_huge, _mp_real_expm1_fp, _mp_real_exp2_fp (mp_real.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/mp_real/_mp_real_exp_fp.html (generated 2026-11-17).
@misc{flint-doc-mp-real-mp-real-exp-fp,
author = {{The FLINT team}},
title = {{\_mp\_real\_exp\_fp, \_mp\_real\_exp\_fp\_huge, \_mp\_real\_expm1\_fp, \_mp\_real\_exp2\_fp (mp\_real.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/mp_real/_mp_real_exp_fp.html},
note = {Generated 2026-11-17}
}