fmpz_factor_refine
Synopsis
#include <flint/fmpz_factor.h>void fmpz_factor_refine(fmpz_factor_t res, const fmpz_factor_t f)sourceGiven a partial factorisation f of an integer (bases need not be prime, coprime or in any order, and may be 1), sets res to a factorisation of the same integer whose bases are pairwise coprime and greater than 1, by the factor refinement algorithm of Bach, Driscoll and Shallit [BDS1993], which uses repeated GCDs. The result need not consist of primes and is not sorted.
References#
- [BDS1993] E. Bach, J. Driscoll and J. Shallit. Factor refinement. Journal of Algorithms 15 (1993), 199–222.
Cite this page
The FLINT team, “fmpz_factor_refine (fmpz_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_factor/fmpz_factor_refine.html (generated 2026-10-20).
@misc{flint-doc-fmpz-factor-fmpz-factor-refine,
author = {{The FLINT team}},
title = {{fmpz\_factor\_refine (fmpz\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_factor/fmpz_factor_refine.html},
note = {Generated 2026-10-20}
}