`radix_integer_trunc_limbs, radix_integer_trunc_digits, radix_integer_mod_limbs, radix_integer_mod_digits, radix_integer_smod_limbs`

Synopsis#include <flint/radix.h>

void radix_integer_trunc_limbs(radix_integer_t res, const radix_integer_t x, slong n, const radix_t radix)source

void radix_integer_trunc_digits(radix_integer_t res, const radix_integer_t x, slong n, const radix_t radix)source

void radix_integer_mod_limbs(radix_integer_t res, const radix_integer_t x, slong n, const radix_t radix)source

void radix_integer_mod_digits(radix_integer_t res, const radix_integer_t x, slong n, const radix_t radix)source

void radix_integer_smod_limbs(radix_integer_t res, const radix_integer_t x, slong n, const radix_t radix)source

Reductions modulo $B^n$ (respectively $b^n$ ): trunc reduces $|x|$ and keeps the sign of $x$ ; mod returns the representative in $[0, B^n - 1]$ ( $[0, b^n - 1]$ ); smod returns the symmetric representative, in $[-\lfloor B^n/2 \rfloor, \lfloor B^n/2 \rfloor]$ for odd $B$ and in $[-B^n/2, B^n/2 - 1]$ for even $B$ . These take time $O(n)$ plus the time to copy.

Guides#

Arithmetic in radix b^e

Cite this page

The FLINT team, “radix_integer_trunc_limbs, radix_integer_trunc_digits, radix_integer_mod_limbs, radix_integer_mod_digits, radix_integer_smod_limbs (radix.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/radix/radix_integer_trunc_limbs.html (generated 2026-11-02).

@misc{flint-doc-radix-radix-integer-trunc-limbs,
  author       = {{The FLINT team}},
  title        = {{radix\_integer\_trunc\_limbs, radix\_integer\_trunc\_digits, radix\_integer\_mod\_limbs, radix\_integer\_mod\_digits, radix\_integer\_smod\_limbs (radix.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/radix/radix_integer_trunc_limbs.html},
  note         = {Generated 2026-11-02}
}

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