_fmpz_mat_find_good_prime_and_lu, _fmpz_mat_find_good_prime_and_lu2
Synopsis
#include <flint/fmpz_mat.h>ulong _fmpz_mat_find_good_prime_and_lu(nmod_mat_t LU, slong * P, const fmpz_mat_t A, const fmpz_t det_bound)sourceulong _fmpz_mat_find_good_prime_and_lu2(nmod_mat_t LU, slong * P, const fmpz_mat_t A, const fmpz_t det_bound, slong bits, int A_is_known_nonsingular)sourceAs fmpz_mat_find_good_prime_and_invert, but returns the LU decomposition of A modulo p in LU and P as computed by nmod_mat_lu_with_pivots. The second version starts the search at 2^{\mathit{bits}}; if A_is_known_nonsingular is set it attempts no certification and det_bound may be NULL.
Cite this page
The FLINT team, “_fmpz_mat_find_good_prime_and_lu, _fmpz_mat_find_good_prime_and_lu2 (fmpz_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mat/_fmpz_mat_find_good_prime_and_lu.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mat-fmpz-mat-find-good-prime-and-lu,
author = {{The FLINT team}},
title = {{\_fmpz\_mat\_find\_good\_prime\_and\_lu, \_fmpz\_mat\_find\_good\_prime\_and\_lu2 (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_find_good_prime_and_lu.html},
note = {Generated 2026-10-20}
}