eudiv_qrnd, eudiv_qqrnnd, eudiv_qrrnndd
Synopsis
#include <flint/mpn_extras.h>eudiv_qrnd(q, r, n, d, t)sourceeudiv_qqrnnd(q1, q0, r0, n1, n0, d0, t)sourceeudiv_qrrnndd(q0, r1, r0, n1, n0, d1, d0, t)sourceEuclidean divisions of one or two limbs by one or two limbs where the quotient is expected to be small (as in a continued fraction expansion): the quotient is found by repeated subtraction for the first few values before falling back to a division. They require n > d > 0; the two-by-two version requires d_1 \ne 0. t is a prefix for the local variables.
Cite this page
The FLINT team, “eudiv_qrnd, eudiv_qqrnnd, eudiv_qrrnndd (mpn_extras.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/mpn_extras/eudiv_qrnd.html (generated 2026-10-20).
@misc{flint-doc-mpn-extras-eudiv-qrnd,
author = {{The FLINT team}},
title = {{eudiv\_qrnd, eudiv\_qqrnnd, eudiv\_qrrnndd (mpn\_extras.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/mpn_extras/eudiv_qrnd.html},
note = {Generated 2026-10-20}
}