`_nmod_poly_div_root, nmod_poly_div_root`

Synopsis#include <flint/nmod_poly.h>

ulong _nmod_poly_div_root(nn_ptr Q, nn_srcptr A, slong len, ulong c, nmod_t mod)source

ulong nmod_poly_div_root(nmod_poly_t Q, const nmod_poly_t A, ulong c)source

Set $Q$ to the quotient of $A$ by $x - c$ and return the remainder $A(c)$ , by Horner's rule (synthetic division). The value $c$ must be reduced. The underscore version requires $\mathit{len} \ge 2$ (for smaller lengths it returns 0 and writes nothing), writes $\mathit{len} - 1$ coefficients and allows Q == A.

Cite this page

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

@misc{flint-doc-nmod-poly-nmod-poly-div-root,
  author       = {{The FLINT team}},
  title        = {{\_nmod\_poly\_div\_root, nmod\_poly\_div\_root (nmod\_poly.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/nmod_poly/_nmod_poly_div_root.html},
  note         = {Generated 2026-11-02}
}

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