Searched refs:nmodF (Results 1 – 3 of 3) sorted by relevance
| /dports/math/e-antic/flint2-ae7ec89/fmpz/ |
| H A D | is_prime.c | 222 fmpz_t F, nmodF; in fmpz_is_prime() local
234 fmpz_init(nmodF); in fmpz_is_prime()
236 fmpz_mod(nmodF, n, F); /* check n mod F not factor of n */ in fmpz_is_prime()
238 if (!fmpz_equal(nmodF, n) && !fmpz_is_one(nmodF) in fmpz_is_prime()
239 && fmpz_divisible(n, nmodF)) in fmpz_is_prime()
242 fmpz_clear(nmodF); in fmpz_is_prime()
|
| /dports/math/flint2/flint-2.8.4/fmpz/ |
| H A D | is_prime.c | 222 fmpz_t F, nmodF; in fmpz_is_prime() local
234 fmpz_init(nmodF); in fmpz_is_prime()
236 fmpz_mod(nmodF, n, F); /* check n mod F not factor of n */ in fmpz_is_prime()
238 if (!fmpz_equal(nmodF, n) && !fmpz_is_one(nmodF) in fmpz_is_prime()
239 && fmpz_divisible(n, nmodF)) in fmpz_is_prime()
242 fmpz_clear(nmodF); in fmpz_is_prime()
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz/ |
| H A D | is_prime.c | 222 fmpz_t F, nmodF; in fmpz_is_prime() local
234 fmpz_init(nmodF); in fmpz_is_prime()
236 fmpz_mod(nmodF, n, F); /* check n mod F not factor of n */ in fmpz_is_prime()
238 if (!fmpz_equal(nmodF, n) && !fmpz_is_one(nmodF) in fmpz_is_prime()
239 && fmpz_divisible(n, nmodF)) in fmpz_is_prime()
242 fmpz_clear(nmodF); in fmpz_is_prime()
|