aprcl_config_jacobi_init, aprcl_config_jacobi_init_R, aprcl_config_jacobi_clear
#include <flint/aprcl.h>void aprcl_config_jacobi_init(aprcl_config conf, const fmpz_t n)sourcevoid aprcl_config_jacobi_init_R(aprcl_config conf, const fmpz_t n, ulong R)sourcevoid aprcl_config_jacobi_clear(aprcl_config conf)sourceInitialise conf for the Jacobi sum test of , with from aprcl_R_value respectively the given , and free it. If the value of aprcl_R_value does not give , aprcl_config_jacobi_init multiplies by the next primes after its largest prime factor until it does (throwing an exception if would overflow a word). The full for is reduced by dropping the prime powers whose tests are the most expensive per bit contributed to (estimated from the sizes of for , and very large first) as long as remains.
The FLINT team, “aprcl_config_jacobi_init, aprcl_config_jacobi_init_R, aprcl_config_jacobi_clear (aprcl.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/aprcl/aprcl_config_jacobi_init.html (generated 2026-11-02).
@misc{flint-doc-aprcl-aprcl-config-jacobi-init,
author = {{The FLINT team}},
title = {{aprcl\_config\_jacobi\_init, aprcl\_config\_jacobi\_init\_R, aprcl\_config\_jacobi\_clear (aprcl.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/aprcl/aprcl_config_jacobi_init.html},
note = {Generated 2026-11-02}
}