dirichlet_chi_vec_primeloop, dirichlet_chi_vec_primeloop_order
Synopsis
#include <flint/dirichlet.h>void dirichlet_chi_vec_primeloop(ulong * v, const dirichlet_group_t G, const dirichlet_char_t chi, slong nv)sourcevoid dirichlet_chi_vec_primeloop_order(ulong * v, const dirichlet_group_t G, const dirichlet_char_t chi, ulong order, slong nv)sourceAs dirichlet_chi_vec, by adding the contributions of the components: the 2-part directly, and each odd prime power with dlog_vec_add, which computes the discrete logarithms of all k < \mathit{nv} by sieving (using the tables of G if present). See the warning about v[0] at dirichlet_chi_vec.
Cite this page
The FLINT team, “dirichlet_chi_vec_primeloop, dirichlet_chi_vec_primeloop_order (dirichlet.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/dirichlet/dirichlet_chi_vec_primeloop.html (generated 2026-10-20).
@misc{flint-doc-dirichlet-dirichlet-chi-vec-primeloop,
author = {{The FLINT team}},
title = {{dirichlet\_chi\_vec\_primeloop, dirichlet\_chi\_vec\_primeloop\_order (dirichlet.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/dirichlet/dirichlet_chi_vec_primeloop.html},
note = {Generated 2026-10-20}
}