fmpz_poly_num_real_roots_0_1, fmpz_poly_num_real_roots_0_1_sturm, fmpz_poly_num_real_roots_0_1_vca
Synopsis
#include <flint/fmpz_poly.h>slong fmpz_poly_num_real_roots_0_1(const fmpz_poly_t pol)sourceslong fmpz_poly_num_real_roots_0_1_sturm(const fmpz_poly_t pol)sourceslong fmpz_poly_num_real_roots_0_1_vca(const fmpz_poly_t pol)sourceReturn the number of roots of the squarefree polynomial pol in the open interval (0, 1). The default first applies Descartes' rule of signs on (0, 1), which settles most generic polynomials, then tries the primitive Sturm sequence with a growth bound and falls back on the Vincent–Collins–Akritas algorithm. A zero polynomial raises an exception.
Cite this page
The FLINT team, “fmpz_poly_num_real_roots_0_1, fmpz_poly_num_real_roots_0_1_sturm, fmpz_poly_num_real_roots_0_1_vca (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/fmpz_poly_num_real_roots_0_1.html (generated 2026-10-20).
@misc{flint-doc-fmpz-poly-fmpz-poly-num-real-roots-0-1,
author = {{The FLINT team}},
title = {{fmpz\_poly\_num\_real\_roots\_0\_1, fmpz\_poly\_num\_real\_roots\_0\_1\_sturm, fmpz\_poly\_num\_real\_roots\_0\_1\_vca (fmpz\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_poly/fmpz_poly_num_real_roots_0_1.html},
note = {Generated 2026-10-20}
}