1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
/*
Copyright (C) 2009 William Hart
This file is part of FLINT.
FLINT is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 3 of the License, or
(at your option) any later version. See <https://www.gnu.org/licenses/>.
*/
#include "test_helpers.h"
#include "gmpcompat.h"
#include "ulong_extras.h"
TEST_FUNCTION_START(n_is_probabprime_BPSW, state)
{
int i, result;
ulong d;
mpz_t d_m;
for (i = 0; i < 10000 * flint_test_multiplier(); i++) /* Test that primes pass the test */
{
mpz_init(d_m);
do
{
d = n_randtest_not_zero(state);
flint_mpz_set_ui(d_m, d);
mpz_nextprime(d_m, d_m);
d = flint_mpz_get_ui(d_m);
} while (mpz_size(d_m) > 1);
result = n_is_probabprime_BPSW(d);
if (!result)
TEST_FUNCTION_FAIL("d = %wu is declared composite\n", d);
mpz_clear(d_m);
}
for (i = 0; i < 10000 * flint_test_multiplier(); i++) /* Test that not too many composites pass */
{
mpz_init(d_m);
do
{
d = n_randtest(state);
flint_mpz_set_ui(d_m, d);
} while (mpz_probab_prime_p(d_m, 12));
result = (n_is_probabprime_BPSW(d) == 0);
if (!result)
TEST_FUNCTION_FAIL("d = %wu is declared prime\n", d);
mpz_clear(d_m);
}
TEST_FUNCTION_END(state);
}