fmpz_mat_dixon_get_crt_primes
Synopsis
#include <flint/fmpz_mat.h>ulong * fmpz_mat_dixon_get_crt_primes(slong * num_primes, const fmpz_mat_t A, ulong p)sourceReturns an array of num_primes primes, p and the primes following it, whose product exceeds 2n \lVert A \rVert_\infty (p - 1), so that products Ay with y reduced modulo p can be computed multimodularly. The caller frees the array with flint_free.
Cite this page
The FLINT team, “fmpz_mat_dixon_get_crt_primes (fmpz_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mat/fmpz_mat_dixon_get_crt_primes.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mat-fmpz-mat-dixon-get-crt-primes,
author = {{The FLINT team}},
title = {{fmpz\_mat\_dixon\_get\_crt\_primes (fmpz\_mat.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mat/fmpz_mat_dixon_get_crt_primes.html},
note = {Generated 2026-10-20}
}