mpn_mul_2expmod_2expp1, mpn_div_2expmod_2expp1
Synopsis
#include <flint/fft.h>void mpn_mul_2expmod_2expp1(mp_limb_t * t, mp_limb_t * i1, mp_size_t limbs, flint_bitcnt_t d)sourcevoid mpn_div_2expmod_2expp1(mp_limb_t * t, mp_limb_t * i1, mp_size_t limbs, flint_bitcnt_t d)sourceSet t to i_1 \cdot 2^d, respectively i_1 / 2^d, modulo p, for 0 \le d < \mathtt{FLINT\_BITS} and a residue i_1 whose top limb is small. The result is not necessarily reduced.
Cite this page
The FLINT team, “mpn_mul_2expmod_2expp1, mpn_div_2expmod_2expp1 (fft.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fft/mpn_mul_2expmod_2expp1.html (generated 2026-10-20).
@misc{flint-doc-fft-mpn-mul-2expmod-2expp1,
author = {{The FLINT team}},
title = {{mpn\_mul\_2expmod\_2expp1, mpn\_div\_2expmod\_2expp1 (fft.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fft/mpn_mul_2expmod_2expp1.html},
note = {Generated 2026-10-20}
}