_nf_elem_norm_div, nf_elem_norm_div
Synopsis
#include <flint/nf_elem.h>void _nf_elem_norm_div(fmpz_t rnum, fmpz_t rden, const nf_elem_t a, const nf_t nf, const fmpz_t divisor, slong nbits)sourcevoid nf_elem_norm_div(fmpq_t res, const nf_elem_t a, const nf_t nf, const fmpz_t divisor, slong nbits)sourceSet the result to N_{K/\mathbf{Q}}(a)/\mathtt{divisor}, assuming that the quotient of the resultant by divisor is an integer of at most nbits bits; the multimodular resultant (_fmpz_poly_resultant_modular_div) then needs only enough primes for the quotient. For divisor = 0 the result is 0.
Cite this page
The FLINT team, “_nf_elem_norm_div, nf_elem_norm_div (nf_elem.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nf_elem/_nf_elem_norm_div.html (generated 2026-10-20).
@misc{flint-doc-nf-elem-nf-elem-norm-div,
author = {{The FLINT team}},
title = {{\_nf\_elem\_norm\_div, nf\_elem\_norm\_div (nf\_elem.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nf_elem/_nf_elem_norm_div.html},
note = {Generated 2026-10-20}
}