_fmpz_vec_multi_CRT_ui
Synopsis
#include <flint/fmpz_vec.h>void _fmpz_vec_multi_CRT_ui(fmpz * res, nn_srcptr * residues, slong len, nn_srcptr primes, slong num_primes, int sign)sourceSets res[j] for 0 \le j < len to the integer congruent to residues[i][j] modulo primes[i] for all 0 \le i < num_primes, in [0, M) if sign is 0 and in (-M/2, M/2] otherwise, where M is the product of the pairwise coprime word-size moduli. The precomputation is shared by all entries; each entry is reconstructed as by fmpz_multi_CRT_ui (Chinese remaindering).
Cite this page
The FLINT team, “_fmpz_vec_multi_CRT_ui (fmpz_vec.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_vec/_fmpz_vec_multi_CRT_ui.html (generated 2026-10-20).
@misc{flint-doc-fmpz-vec-fmpz-vec-multi-CRT-ui,
author = {{The FLINT team}},
title = {{\_fmpz\_vec\_multi\_CRT\_ui (fmpz\_vec.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_vec/_fmpz_vec_multi_CRT_ui.html},
note = {Generated 2026-10-20}
}