_fmpz_mod_poly_sqrt_series, fmpz_mod_poly_sqrt_series, _fmpz_mod_poly_invsqrt_series, fmpz_mod_poly_invsqrt_series
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_sqrt_series(fmpz * g, const fmpz * h, slong hlen, slong n, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_sqrt_series(fmpz_mod_poly_t g, const fmpz_mod_poly_t h, slong n, const fmpz_mod_ctx_t ctx)sourcevoid _fmpz_mod_poly_invsqrt_series(fmpz * g, const fmpz * h, slong hlen, slong n, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_invsqrt_series(fmpz_mod_poly_t g, const fmpz_mod_poly_t h, slong n, const fmpz_mod_ctx_t ctx)sourceSet g to \sqrt{h}, respectively 1/\sqrt{h}, modulo x^n, the series being defined by the binomial expansion of (1 + y)^{\pm 1/2}. The constant term of h must be 1 (an exception is raised otherwise), and 2 must be invertible modulo n. The underscore versions require n > 0 and \mathit{hlen} > 0 and do not allow aliasing.
Cite this page
The FLINT team, “_fmpz_mod_poly_sqrt_series, fmpz_mod_poly_sqrt_series, _fmpz_mod_poly_invsqrt_series, fmpz_mod_poly_invsqrt_series (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_sqrt_series.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-sqrt-series,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_sqrt\_series, fmpz\_mod\_poly\_sqrt\_series, \_fmpz\_mod\_poly\_invsqrt\_series, fmpz\_mod\_poly\_invsqrt\_series (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_sqrt_series.html},
note = {Generated 2026-10-20}
}