FLINT3.7.0-dev

radix_divmod_bn_1, radix_divmod_bn_classical, radix_divmod_bn_karp_markstein

Synopsis#include <flint/radix.h>
int radix_divmod_bn_1(nn_ptr q, nn_ptr rem, nn_srcptr a, slong an, ulong b, slong n, const radix_t radix)source
int radix_divmod_bn_classical(nn_ptr q, nn_ptr rem, nn_srcptr a, slong an, nn_srcptr b, slong bn, slong n, const radix_t radix)source
int radix_divmod_bn_karp_markstein(nn_ptr q, nn_ptr rem, nn_srcptr a, slong an, nn_srcptr b, slong bn, slong n, const radix_t radix)source

The algorithms behind radix_divmod_bn, with its interface: a one-limb divisor (with rem of one limb), the blockwise algorithm (one low and one high product per block of \mathit{bn} limbs), and the Karp–Markstein form with a half-precision inverse.

Cite this page

The FLINT team, “radix_divmod_bn_1, radix_divmod_bn_classical, radix_divmod_bn_karp_markstein (radix.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/radix/radix_divmod_bn_1.html (generated 2026-10-20).