n_remove, n_remove2_precomp
Synopsis
#include <flint/ulong_extras.h>For p = 2 trailing zeros are counted. Otherwise n_remove repeatedly squares p, storing a table of powers and removing the highest power at each step, then walks back down the table. n_remove2_precomp repeatedly calls n_divrem2_precomp.
Cite this page
The FLINT team, “n_remove, n_remove2_precomp (ulong_extras.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/ulong_extras/n_remove.html (generated 2026-10-20).
@misc{flint-doc-ulong-extras-n-remove,
author = {{The FLINT team}},
title = {{n\_remove, n\_remove2\_precomp (ulong\_extras.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/ulong_extras/n_remove.html},
note = {Generated 2026-10-20}
}