`radix_divmod_bn`

Synopsis#include <flint/radix.h>

int radix_divmod_bn(nn_ptr q, nn_ptr rem, nn_srcptr a, slong an, nn_srcptr b, slong bn, slong n, const radix_t radix)source

Given $(b, \mathit{bn})$ invertible modulo $B$ , sets $(q, n)$ to the $B$ -adic (Hensel) quotient with $qb \equiv a \pmod{B^n}$ and returns 1; returns 0 if $b$ is not invertible. If rem is not NULL, the remainder $(a - qb)/B^n \bmod B^{bn}$ is written to $(\mathit{rem}, \mathit{bn})$ , so that $a \equiv qb + B^n \mathit{rem} \pmod{B^{n + bn}}$ .

Cite this page

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

@misc{flint-doc-radix-radix-divmod-bn,
  author       = {{The FLINT team}},
  title        = {{radix\_divmod\_bn (radix.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/radix/radix_divmod_bn.html},
  note         = {Generated 2026-11-02}
}

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