_aprcl_is_prime_jacobi_check_pk_mpn, _aprcl_is_prime_jacobi_check_22_mpn, _aprcl_is_prime_jacobi_check_2k_mpn
Synopsis
#include <flint/aprcl.h>int _aprcl_is_prime_jacobi_check_22_mpn(slong * h, const unity_zp j, const fmpz_t u, ulong v, ulong q)sourceint _aprcl_is_prime_jacobi_check_2k_mpn(slong * h, const unity_zp j, const unity_zp j2_1, const unity_zp j2_2, const fmpz_t u, ulong v)sourceThe same checks with unity_zp_mpn arithmetic. They return 0 without computing anything if the modulus is not supported by mpn_mod (fewer than 2 or more than 16 limbs), in which case the caller falls back to the unity_zp versions; otherwise they return 1 and store the result in *h.
Cite this page
The FLINT team, “_aprcl_is_prime_jacobi_check_pk_mpn, _aprcl_is_prime_jacobi_check_22_mpn, _aprcl_is_prime_jacobi_check_2k_mpn (aprcl.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/aprcl/_aprcl_is_prime_jacobi_check_pk_mpn.html (generated 2026-10-20).
@misc{flint-doc-aprcl-aprcl-is-prime-jacobi-check-pk-mpn,
author = {{The FLINT team}},
title = {{\_aprcl\_is\_prime\_jacobi\_check\_pk\_mpn, \_aprcl\_is\_prime\_jacobi\_check\_22\_mpn, \_aprcl\_is\_prime\_jacobi\_check\_2k\_mpn (aprcl.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/aprcl/_aprcl_is_prime_jacobi_check_pk_mpn.html},
note = {Generated 2026-10-20}
}