| /dports/math/e-antic/flint2-ae7ec89/fmpz/test/ |
| H A D | t-is_prime_morrison.c | 33 slong num_pp1; in main() local
50 _fmpz_np1_trial_factors(p, pp1, &num_pp1, limit); in main()
52 result = fmpz_is_prime_morrison(F, R, p, pp1, num_pp1); in main()
|
| /dports/math/flint2/flint-2.8.4/fmpz/test/ |
| H A D | t-is_prime_morrison.c | 33 slong num_pp1; in main() local
50 _fmpz_np1_trial_factors(p, pp1, &num_pp1, limit); in main()
52 result = fmpz_is_prime_morrison(F, R, p, pp1, num_pp1); in main()
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz/test/ |
| H A D | t-is_prime_morrison.c | 33 slong num_pp1; in main() local
50 _fmpz_np1_trial_factors(p, pp1, &num_pp1, limit); in main()
52 result = fmpz_is_prime_morrison(F, R, p, pp1, num_pp1); in main()
|
| /dports/math/e-antic/flint2-ae7ec89/fmpz/ |
| H A D | is_prime_morrison.c | 24 void _fmpz_np1_trial_factors(const fmpz_t n, mp_ptr pp1, slong * num_pp1, ulong limit) in _fmpz_np1_trial_factors() argument
31 *num_pp1 = 0; in _fmpz_np1_trial_factors()
61 pp1[(*num_pp1)++] = primes[i]; in _fmpz_np1_trial_factors()
70 int fmpz_is_prime_morrison(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pp1, slong num_pp1) in fmpz_is_prime_morrison() argument
100 for (i = 0; i < num_pp1; i++) in fmpz_is_prime_morrison()
|
| 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()
126 pp1[num_pp1++] = primes[i]; in fmpz_is_prime()
173 res = fmpz_is_prime_morrison(F2, R, n, pp1, num_pp1); in fmpz_is_prime()
|
| /dports/math/flint2/flint-2.8.4/fmpz/ |
| H A D | is_prime_morrison.c | 24 void _fmpz_np1_trial_factors(const fmpz_t n, mp_ptr pp1, slong * num_pp1, ulong limit) in _fmpz_np1_trial_factors() argument
31 *num_pp1 = 0; in _fmpz_np1_trial_factors()
61 pp1[(*num_pp1)++] = primes[i]; in _fmpz_np1_trial_factors()
70 int fmpz_is_prime_morrison(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pp1, slong num_pp1) in fmpz_is_prime_morrison() argument
100 for (i = 0; i < num_pp1; i++) in fmpz_is_prime_morrison()
|
| 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()
126 pp1[num_pp1++] = primes[i]; in fmpz_is_prime()
173 res = fmpz_is_prime_morrison(F2, R, n, pp1, num_pp1); in fmpz_is_prime()
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz/ |
| H A D | is_prime_morrison.c | 24 void _fmpz_np1_trial_factors(const fmpz_t n, mp_ptr pp1, slong * num_pp1, ulong limit) in _fmpz_np1_trial_factors() argument
31 *num_pp1 = 0; in _fmpz_np1_trial_factors()
61 pp1[(*num_pp1)++] = primes[i]; in _fmpz_np1_trial_factors()
70 int fmpz_is_prime_morrison(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pp1, slong num_pp1) in fmpz_is_prime_morrison() argument
100 for (i = 0; i < num_pp1; i++) in fmpz_is_prime_morrison()
|
| 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()
126 pp1[num_pp1++] = primes[i]; in fmpz_is_prime()
173 res = fmpz_is_prime_morrison(F2, R, n, pp1, num_pp1); in fmpz_is_prime()
|
| /dports/math/e-antic/flint2-ae7ec89/doc/source/ |
| H A D | fmpz.rst | 1423 …unction:: int fmpz_is_prime_morrison(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pp1, slong num_pp1)
1436 these must be supplied as an array ``pp1`` of length ``num_pp1``.
1451 .. function:: void _fmpz_np1_trial_factors(const fmpz_t n, mp_ptr pp1, slong * num_pp1, ulong limit)
1455 ``num_pp1``.
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/doc/source/ |
| H A D | fmpz.rst | 1423 …unction:: int fmpz_is_prime_morrison(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pp1, slong num_pp1)
1436 these must be supplied as an array ``pp1`` of length ``num_pp1``.
1451 .. function:: void _fmpz_np1_trial_factors(const fmpz_t n, mp_ptr pp1, slong * num_pp1, ulong limit)
1455 ``num_pp1``.
|
| /dports/math/e-antic/flint2-ae7ec89/ |
| H A D | fmpz.h | 870 mp_ptr pp1, slong * num_pp1, ulong limit);
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/ |
| H A D | fmpz.h | 870 mp_ptr pp1, slong * num_pp1, ulong limit);
|
| /dports/math/flint2/flint-2.8.4/doc/source/ |
| H A D | fmpz.rst | 1483 …unction:: int fmpz_is_prime_morrison(fmpz_t F, fmpz_t R, const fmpz_t n, mp_ptr pp1, slong num_pp1)
1496 these must be supplied as an array ``pp1`` of length ``num_pp1``.
1511 .. function:: void _fmpz_np1_trial_factors(const fmpz_t n, mp_ptr pp1, slong * num_pp1, ulong limit)
1515 ``num_pp1``.
|
| /dports/math/flint2/flint-2.8.4/ |
| H A D | fmpz.h | 1029 mp_ptr pp1, slong * num_pp1, ulong limit);
|