_acb_poly_div, _acb_poly_rem, _acb_poly_divrem
Synopsis
#include <flint/acb_poly.h>void _acb_poly_div(acb_ptr Q, acb_srcptr A, slong lenA, acb_srcptr B, slong lenB, slong prec)sourcevoid _acb_poly_rem(acb_ptr R, acb_srcptr A, slong lenA, acb_srcptr B, slong lenB, slong prec)sourcevoid _acb_poly_divrem(acb_ptr Q, acb_ptr R, acb_srcptr A, slong lenA, acb_srcptr B, slong lenB, slong prec)sourceCompute the quotient {Q, lenA - lenB + 1} and/or the remainder {R, lenB - 1} of the division of {A, lenA} by {B, lenB}. Require \mathit{lenA} \ge \mathit{lenB} \ge 1 and no aliasing. If the leading coefficient of B contains zero, the output is not finite.
Cite this page
The FLINT team, “_acb_poly_div, _acb_poly_rem, _acb_poly_divrem (acb_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_poly/_acb_poly_div.html (generated 2026-10-20).
@misc{flint-doc-acb-poly-acb-poly-div,
author = {{The FLINT team}},
title = {{\_acb\_poly\_div, \_acb\_poly\_rem, \_acb\_poly\_divrem (acb\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/acb_poly/_acb_poly_div.html},
note = {Generated 2026-10-20}
}