/dports/math/e-antic/flint2-ae7ec89/fmpz/ |
H A D | is_prime_pocklington.c | 24 void _fmpz_nm1_trial_factors(const fmpz_t n, mp_ptr pm1, slong * num_pm1, ulong limit) in _fmpz_nm1_trial_factors() argument 31 *num_pm1 = 0; in _fmpz_nm1_trial_factors() 61 pm1[(*num_pm1)++] = primes[i]; in _fmpz_nm1_trial_factors() 70 int fmpz_is_prime_pocklington(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pm1, slong num_pm1) in fmpz_is_prime_pocklington() argument 92 for (i = 0; i < num_pm1; i++) in fmpz_is_prime_pocklington()
|
H A D | is_prime.c | 32 slong i, l, num, num_pp1, num_pm1; in fmpz_is_prime() local 91 num_pm1 = num_pp1 = 0; in fmpz_is_prime() 123 pm1[num_pm1++] = primes[i]; in fmpz_is_prime() 135 res = fmpz_is_prime_pocklington(F1, R, n, pm1, num_pm1); in fmpz_is_prime()
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz/ |
H A D | is_prime_pocklington.c | 24 void _fmpz_nm1_trial_factors(const fmpz_t n, mp_ptr pm1, slong * num_pm1, ulong limit) in _fmpz_nm1_trial_factors() argument 31 *num_pm1 = 0; in _fmpz_nm1_trial_factors() 61 pm1[(*num_pm1)++] = primes[i]; in _fmpz_nm1_trial_factors() 70 int fmpz_is_prime_pocklington(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pm1, slong num_pm1) in fmpz_is_prime_pocklington() argument 92 for (i = 0; i < num_pm1; i++) in fmpz_is_prime_pocklington()
|
H A D | is_prime.c | 32 slong i, l, num, num_pp1, num_pm1; in fmpz_is_prime() local 91 num_pm1 = num_pp1 = 0; in fmpz_is_prime() 123 pm1[num_pm1++] = primes[i]; in fmpz_is_prime() 135 res = fmpz_is_prime_pocklington(F1, R, n, pm1, num_pm1); in fmpz_is_prime()
|
/dports/math/flint2/flint-2.8.4/fmpz/ |
H A D | is_prime_pocklington.c | 24 void _fmpz_nm1_trial_factors(const fmpz_t n, mp_ptr pm1, slong * num_pm1, ulong limit) in _fmpz_nm1_trial_factors() argument 31 *num_pm1 = 0; in _fmpz_nm1_trial_factors() 61 pm1[(*num_pm1)++] = primes[i]; in _fmpz_nm1_trial_factors() 70 int fmpz_is_prime_pocklington(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pm1, slong num_pm1) in fmpz_is_prime_pocklington() argument 92 for (i = 0; i < num_pm1; i++) in fmpz_is_prime_pocklington()
|
H A D | is_prime.c | 32 slong i, l, num, num_pp1, num_pm1; in fmpz_is_prime() local 91 num_pm1 = num_pp1 = 0; in fmpz_is_prime() 123 pm1[num_pm1++] = primes[i]; in fmpz_is_prime() 135 res = fmpz_is_prime_pocklington(F1, R, n, pm1, num_pm1); in fmpz_is_prime()
|
/dports/math/e-antic/flint2-ae7ec89/fmpz/test/ |
H A D | t-is_prime_pocklington.c | 33 slong num_pm1; in main() local 50 _fmpz_nm1_trial_factors(p, pm1, &num_pm1, limit); in main() 52 result = fmpz_is_prime_pocklington(F, R, p, pm1, num_pm1); in main()
|
/dports/math/flint2/flint-2.8.4/fmpz/test/ |
H A D | t-is_prime_pocklington.c | 33 slong num_pm1; in main() local 50 _fmpz_nm1_trial_factors(p, pm1, &num_pm1, limit); in main() 52 result = fmpz_is_prime_pocklington(F, R, p, pm1, num_pm1); in main()
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz/test/ |
H A D | t-is_prime_pocklington.c | 33 slong num_pm1; in main() local 50 _fmpz_nm1_trial_factors(p, pm1, &num_pm1, limit); in main() 52 result = fmpz_is_prime_pocklington(F, R, p, pm1, num_pm1); in main()
|
/dports/math/e-antic/flint2-ae7ec89/ |
H A D | fmpz.h | 864 slong * num_pm1, ulong limit); 867 const fmpz_t n, mp_ptr pm1, slong num_pm1); 873 const fmpz_t n, mp_ptr pm1, slong num_pm1);
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/ |
H A D | fmpz.h | 864 slong * num_pm1, ulong limit); 867 const fmpz_t n, mp_ptr pm1, slong num_pm1); 873 const fmpz_t n, mp_ptr pm1, slong num_pm1);
|
/dports/math/flint2/flint-2.8.4/ |
H A D | fmpz.h | 1023 slong * num_pm1, ulong limit); 1026 const fmpz_t n, mp_ptr pm1, slong num_pm1); 1032 const fmpz_t n, mp_ptr pm1, slong num_pm1);
|
/dports/math/e-antic/flint2-ae7ec89/doc/source/ |
H A D | fmpz.rst | 1386 …tion:: int fmpz_is_prime_pocklington(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pm1, slong num_pm1) 1398 these must be supplied as an array ``pm1`` of length ``num_pm1``. 1413 .. function:: void _fmpz_nm1_trial_factors(const fmpz_t n, mp_ptr pm1, slong * num_pm1, ulong limit) 1417 ``num_pm1``.
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/doc/source/ |
H A D | fmpz.rst | 1386 …tion:: int fmpz_is_prime_pocklington(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pm1, slong num_pm1) 1398 these must be supplied as an array ``pm1`` of length ``num_pm1``. 1413 .. function:: void _fmpz_nm1_trial_factors(const fmpz_t n, mp_ptr pm1, slong * num_pm1, ulong limit) 1417 ``num_pm1``.
|
/dports/math/flint2/flint-2.8.4/doc/source/ |
H A D | fmpz.rst | 1446 …tion:: int fmpz_is_prime_pocklington(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pm1, slong num_pm1) 1458 these must be supplied as an array ``pm1`` of length ``num_pm1``. 1473 .. function:: void _fmpz_nm1_trial_factors(const fmpz_t n, mp_ptr pm1, slong * num_pm1, ulong limit) 1477 ``num_pm1``.
|