_mp_real_log_fp, _mp_real_log_fp_huge, _mp_real_log1p_fp
#include <flint/mp_real.h>int _mp_real_log_fp(nn_ptr y, slong * len, slong * ue, ulong * err, nn_srcptr d, slong n, slong e, int base2, slong pb)sourceint _mp_real_log_fp_huge(nn_ptr y, slong * len, slong * ue, ulong * err, nn_srcptr d, slong n, nn_srcptr c, slong cn, int cneg, slong pb)sourceint _mp_real_log1p_fp(nn_ptr y, slong * len, slong * ue, ulong * err, nn_srcptr d, slong n, slong e, int sgnbit, slong pb)sourceThe logarithm (base2 = 1: the binary logarithm) of with : sets (y needs nk + n + 5 limbs), the radix-2 exponent ue of its unit and err, and returns 1 when , so that within err units ( gives len = 0). Near 1 the kernel runs at as many more limbs as the cancellation costs (at most more), so the result keeps its relative accuracy. _mp_real_log_fp_huge takes a bignum (y needs nk + cn + 3 limbs). _mp_real_log1p_fp is for : for by the kernel of at more bits (y needs nk + 3 - e / FLINT_BITS limbs), otherwise on formed exactly, or as plus a term below a unit for huge .
The FLINT team, “_mp_real_log_fp, _mp_real_log_fp_huge, _mp_real_log1p_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_log_fp.html (generated 2026-11-17).
@misc{flint-doc-mp-real-mp-real-log-fp,
author = {{The FLINT team}},
title = {{\_mp\_real\_log\_fp, \_mp\_real\_log\_fp\_huge, \_mp\_real\_log1p\_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_log_fp.html},
note = {Generated 2026-11-17}
}