`fmpz_poly_bit_unpack, fmpz_poly_bit_unpack_unsigned`

Synopsis#include <flint/fmpz_poly.h>

void fmpz_poly_bit_unpack(fmpz_poly_t poly, const fmpz_t f, flint_bitcnt_t bit_size)source

void fmpz_poly_bit_unpack_unsigned(fmpz_poly_t poly, const fmpz_t f, flint_bitcnt_t bit_size)source

Set poly to the polynomial with signed (respectively nonnegative) coefficients of absolute value less than $2^{b-1}$ (respectively $2^b$ ) such that $\mathit{poly}(2^b) = f$ , for $b$ = bit_size. The unsigned version requires $f \ge 0$ .

Cite this page

The FLINT team, “fmpz_poly_bit_unpack, fmpz_poly_bit_unpack_unsigned (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/fmpz_poly_bit_unpack.html (generated 2026-11-02).

@misc{flint-doc-fmpz-poly-fmpz-poly-bit-unpack,
  author       = {{The FLINT team}},
  title        = {{fmpz\_poly\_bit\_unpack, fmpz\_poly\_bit\_unpack\_unsigned (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_bit_unpack.html},
  note         = {Generated 2026-11-02}
}

Edit this page · PDF version · Built with fdoc from 0a4634bf95