ARB_LOG_PRIME_CACHE_NUM, ARB_ATAN_GAUSS_PRIME_CACHE_NUM, ARB_LOG_REDUCTION_DEFAULT_MAX_PREC, ARB_SIN_COS_ATAN_REDUCTION_DEFAULT_MAX_PREC, ARB_EXP_LOG_REDUCTION_PREC, ARB_SIN_COS_ATAN_REDUCTION_PREC, ARB_LOG_NEWTON_PREC, ARB_ATAN_NEWTON_PREC
#include <flint/arb.h>ARB_LOG_PRIME_CACHE_NUMsourceARB_ATAN_GAUSS_PRIME_CACHE_NUMsourceARB_LOG_REDUCTION_DEFAULT_MAX_PRECsourceARB_SIN_COS_ATAN_REDUCTION_DEFAULT_MAX_PRECsourceARB_EXP_LOG_REDUCTION_PRECsourceARB_SIN_COS_ATAN_REDUCTION_PRECsourceARB_LOG_NEWTON_PRECsourceARB_ATAN_NEWTON_PRECsourceThe number of cached logarithms of primes and arguments of Gaussian primes (13 each), the precision range in which the reduction algorithms are used for the exponential and for sine and cosine (from 2240, respectively 2600 bits, to 4 million bits), and the precisions from which the logarithm (2800 bits) and the arctangent (3400 bits) use Newton iteration.
The FLINT team, “ARB_LOG_PRIME_CACHE_NUM, ARB_ATAN_GAUSS_PRIME_CACHE_NUM, ARB_LOG_REDUCTION_DEFAULT_MAX_PREC, ARB_SIN_COS_ATAN_REDUCTION_DEFAULT_MAX_PREC, ARB_EXP_LOG_REDUCTION_PREC, ARB_SIN_COS_ATAN_REDUCTION_PREC, ARB_LOG_NEWTON_PREC, ARB_ATAN_NEWTON_PREC (arb.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arb/ARB_LOG_PRIME_CACHE_NUM.html (generated 2026-10-20).
@misc{flint-doc-arb-ARB-LOG-PRIME-CACHE-NUM,
author = {{The FLINT team}},
title = {{ARB\_LOG\_PRIME\_CACHE\_NUM, ARB\_ATAN\_GAUSS\_PRIME\_CACHE\_NUM, ARB\_LOG\_REDUCTION\_DEFAULT\_MAX\_PREC, ARB\_SIN\_COS\_ATAN\_REDUCTION\_DEFAULT\_MAX\_PREC, ARB\_EXP\_LOG\_REDUCTION\_PREC, ARB\_SIN\_COS\_ATAN\_REDUCTION\_PREC, ARB\_LOG\_NEWTON\_PREC, ARB\_ATAN\_NEWTON\_PREC (arb.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/arb/ARB_LOG_PRIME_CACHE_NUM.html},
note = {Generated 2026-10-20}
}