fmpz_xgcd_partial
Synopsis
#include <flint/fmpz.h>Runs the extended Euclidean algorithm on r_2 > r_1 > 0 until the remainder drops to at most L, with Lehmer's acceleration. On return r_2 and r_1 are the last two remainders and co2, co1 the corresponding cofactors, with co2\cdot r_1 - co1\cdot r_2 = \pm r_{2,\mathrm{orig}}. No aliasing is allowed.
Cite this page
The FLINT team, “fmpz_xgcd_partial (fmpz.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz/fmpz_xgcd_partial.html (generated 2026-10-20).
@misc{flint-doc-fmpz-fmpz-xgcd-partial,
author = {{The FLINT team}},
title = {{fmpz\_xgcd\_partial (fmpz.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz/fmpz_xgcd_partial.html},
note = {Generated 2026-10-20}
}