ecpp_poly_root
Synopsis
#include <flint/ecpp.h>int ecpp_poly_root(fmpz_t x, const fmpz_mod_poly_t f, flint_rand_t state, const fmpz_mod_ctx_t ctx)sourceSets x to a root of the monic polynomial f, assumed to split completely modulo the prime modulus of ctx: by radicals when possible, and otherwise by random splitting with \gcd(f, (x + r)^{(n-1)/2} - 1). Returns 1 on success and 0 otherwise.
Cite this page
The FLINT team, “ecpp_poly_root (ecpp.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/ecpp/ecpp_poly_root.html (generated 2026-10-20).
@misc{flint-doc-ecpp-ecpp-poly-root,
author = {{The FLINT team}},
title = {{ecpp\_poly\_root (ecpp.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/ecpp/ecpp_poly_root.html},
note = {Generated 2026-10-20}
}