FLINT3.7.0-dev

_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)source
void fmpz_mod_poly_sqrt_series(fmpz_mod_poly_t g, const fmpz_mod_poly_t h, slong n, const fmpz_mod_ctx_t ctx)source
void _fmpz_mod_poly_invsqrt_series(fmpz * g, const fmpz * h, slong hlen, slong n, const fmpz_mod_ctx_t ctx)source
void fmpz_mod_poly_invsqrt_series(fmpz_mod_poly_t g, const fmpz_mod_poly_t h, slong n, const fmpz_mod_ctx_t ctx)source

Set gg to h\sqrt{h}, respectively 1/h1/\sqrt{h}, modulo xnx^n, the series being defined by the binomial expansion of (1+y)±1/2(1 + y)^{\pm 1/2}. The constant term of hh must be 1 (an exception is raised otherwise), and 2 must be invertible modulo nn. The underscore versions require n>0n > 0 and hlen>0\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-11-02).