n_factor_pp1, n_factor_pp1_wrapper
Synopsis
#include <flint/ulong_extras.h>Each choice of c gives another chance of success, with roughly exponentially decreasing probability. If neither p + 1 nor p - 1 is smooth for any factor p of n, the method cannot succeed.
References#
- [Wil1982] H. C. Williams, "A p+1 method of factoring", Mathematics of Computation 39 (1982), 225–234
Cite this page
The FLINT team, “n_factor_pp1, n_factor_pp1_wrapper (ulong_extras.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/ulong_extras/n_factor_pp1.html (generated 2026-10-20).
@misc{flint-doc-ulong-extras-n-factor-pp1,
author = {{The FLINT team}},
title = {{n\_factor\_pp1, n\_factor\_pp1\_wrapper (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_factor_pp1.html},
note = {Generated 2026-10-20}
}