_fmpz_mat_solve_probe_reconstruct
Synopsis
#include <flint/fmpz_mat.h>int _fmpz_mat_solve_probe_reconstruct(fmpz_t num, fmpz_t den, const fmpz_t s, const fmpz_t m, const fmpz_t den_prev, int have_prev)sourceTries to identify the rational number \mathit{num}/\mathit{den} congruent to s modulo m, where s is a random linear combination of the entries of a solution known modulo m: first with the denominators 1 and den_prev (if have_prev is set), then from the continued fraction of s/m, accepting only results with a margin of 30 bits. Returns 1 on success. A wrong result is possible with probability about 2^{-30}; the callers never rely on it for correctness.
Cite this page
The FLINT team, “_fmpz_mat_solve_probe_reconstruct (fmpz_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mat/_fmpz_mat_solve_probe_reconstruct.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mat-fmpz-mat-solve-probe-reconstruct,
author = {{The FLINT team}},
title = {{\_fmpz\_mat\_solve\_probe\_reconstruct (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_solve_probe_reconstruct.html},
note = {Generated 2026-10-20}
}