fft_small_export_mpn
Synopsis
#include <flint/fft_small.h>void fft_small_export_mpn(ulong * z, ulong zn, fft_small_op_t X, const fft_small_plan_t P)sourceWrites to (z, z_n) the integer \sum_k s_k 2^{k \cdot \mathtt{bits}} reduced modulo B^{z_n}, where s_k \in [0, P) are the reconstructed slots. For a product of integers this is the product, exact if z_n is at least its length.
Guides#
Cite this page
The FLINT team, “fft_small_export_mpn (fft_small.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fft_small/fft_small_export_mpn.html (generated 2026-10-20).
@misc{flint-doc-fft-small-fft-small-export-mpn,
author = {{The FLINT team}},
title = {{fft\_small\_export\_mpn (fft\_small.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fft_small/fft_small_export_mpn.html},
note = {Generated 2026-10-20}
}