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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
/*
Copyright (C) 2012 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 "ulong_extras.h"
#include "fmpz.h"
TEST_FUNCTION_START(fmpz_is_probabprime_BPSW, state)
{
int i, result;
/* test primes always pass */
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
fmpz_t p, F;
fmpz_init(p);
fmpz_init(F);
do {
fmpz_randbits(p, state, n_randint(state, 330) + 2);
fmpz_abs(p, p);
} while (!fmpz_is_probabprime(p) || fmpz_cmp_ui(p, 2) == 0);
result = fmpz_is_probabprime_BPSW(p);
if (!result)
{
flint_printf("FAIL:\n");
fmpz_print(p); printf("\n");
fflush(stdout);
flint_abort();
}
fmpz_clear(p);
fmpz_clear(F);
}
/* test composites never pass */
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
fmpz_t p, a, F;
fmpz_init(p);
fmpz_init(a);
fmpz_init(F);
do {
fmpz_randbits(p, state, n_randint(state, 100) + 2);
} while (fmpz_cmp_ui(p, 2) < 0);
do {
fmpz_randbits(a, state, n_randint(state, 100) + 2);
} while (fmpz_cmp_ui(a, 2) < 0);
fmpz_mul(p, p, a);
result = !fmpz_is_probabprime_BPSW(p);
if (!result)
{
flint_printf("FAIL:\n");
fmpz_print(p); printf("\n");
fflush(stdout);
flint_abort();
}
fmpz_clear(p);
fmpz_clear(a);
fmpz_clear(F);
}
TEST_FUNCTION_END(state);
}