_acb_poly_zeta_em_tail_naive, _acb_poly_zeta_em_tail_bsplit
Synopsis
#include <flint/acb_poly.h>void _acb_poly_zeta_em_tail_naive(acb_ptr z, const acb_t s, const acb_t Na, acb_srcptr Nasx, slong M, slong len, slong prec)sourcevoid _acb_poly_zeta_em_tail_bsplit(acb_ptr z, const acb_t s, const acb_t Na, acb_srcptr Nasx, slong M, slong len, slong prec)sourceEvaluate the tail (the Bernoulli number terms) of the Euler–Maclaurin formula for \zeta(s + x, a) as a power series, given N + a and the series of (N + a)^{-(s+x)}, by the naive recurrence or by binary splitting.
Cite this page
The FLINT team, “_acb_poly_zeta_em_tail_naive, _acb_poly_zeta_em_tail_bsplit (acb_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_poly/_acb_poly_zeta_em_tail_naive.html (generated 2026-10-20).
@misc{flint-doc-acb-poly-acb-poly-zeta-em-tail-naive,
author = {{The FLINT team}},
title = {{\_acb\_poly\_zeta\_em\_tail\_naive, \_acb\_poly\_zeta\_em\_tail\_bsplit (acb\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/acb_poly/_acb_poly_zeta_em_tail_naive.html},
note = {Generated 2026-10-20}
}