_arb_hypgeom_gamma_upper_fmpq_inf_bsplit, _arb_hypgeom_gamma_upper_fmpq_inf_bsplit_sum
Synopsis
#include <flint/arb_hypgeom.h>void _arb_hypgeom_gamma_upper_fmpq_inf_bsplit(arb_t res, const fmpq_t a, const arb_t z, slong N, slong prec)sourcevoid _arb_hypgeom_gamma_upper_fmpq_inf_bsplit_sum(arb_t res, const fmpq_t a, const arb_t z, slong N, slong prec)sourceSets res to the asymptotic series of at infinity, including the prefactor , truncated before the term of index and computed by binary splitting. The truncation error is not included. The _sum version omits the prefactor, so that res; callers summing many values (for example at for consecutive ) can then supply cheaply, as a power of a shared exponential.
Cite this page
The FLINT team, “_arb_hypgeom_gamma_upper_fmpq_inf_bsplit, _arb_hypgeom_gamma_upper_fmpq_inf_bsplit_sum (arb_hypgeom.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arb_hypgeom/_arb_hypgeom_gamma_upper_fmpq_inf_bsplit.html (generated 2026-11-20).
@misc{flint-doc-arb-hypgeom-arb-hypgeom-gamma-upper-fmpq-inf-bsplit,
author = {{The FLINT team}},
title = {{\_arb\_hypgeom\_gamma\_upper\_fmpq\_inf\_bsplit, \_arb\_hypgeom\_gamma\_upper\_fmpq\_inf\_bsplit\_sum (arb\_hypgeom.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/arb_hypgeom/_arb_hypgeom_gamma_upper_fmpq_inf_bsplit.html},
note = {Generated 2026-11-20}
}