flint_fmpz_mat_force_small_primes
Synopsis
#include <flint/fmpz_mat.h>int flint_fmpz_mat_force_small_primesA testing hook, not part of the public API. When nonzero, the multimodular and p-adic algorithms for solving, determinants, rank and echelon forms start their prime search at 2 instead of at word-size primes, so that bad primes actually occur. Matrix multiplication is not affected.
Cite this page
The FLINT team, “flint_fmpz_mat_force_small_primes (fmpz_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mat/flint_fmpz_mat_force_small_primes.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mat-flint-fmpz-mat-force-small-primes,
author = {{The FLINT team}},
title = {{flint\_fmpz\_mat\_force\_small\_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/flint_fmpz_mat_force_small_primes.html},
note = {Generated 2026-10-20}
}