FLINT3.7.0-dev

_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)source
void _arb_hypgeom_gamma_upper_fmpq_inf_bsplit_sum(arb_t res, const fmpq_t a, const arb_t z, slong N, slong prec)source

Sets res to the asymptotic series of Γ(a,z)\Gamma(a,z) at infinity, including the prefactor za−1e−zz^{a-1} e^{-z}, truncated before the term of index NN and computed by binary splitting. The truncation error is not included. The _sum version omits the prefactor, so that Γ(a,z)≈za−1e−z⋅\Gamma(a,z) \approx z^{a-1} e^{-z} \cdot res; callers summing many values (for example at z=λNz = \lambda N for consecutive NN) can then supply e−ze^{-z} 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).