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
/*
Copyright (C) 2013 Mike Hansen
Copyright (C) 2024 Vincent Neiger
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"
TEST_FUNCTION_START(n_primitive_root_prime, state)
{
int i, j;
for (i = 0; i < 100; i++)
{
ulong p = n_randtest_prime(state, 1);
ulong pinv = n_preinvert_limb(p);
n_factor_t factors;
n_factor_init(&factors);
n_factor(&factors, p - 1, 1);
ulong root;
root = n_primitive_root_prime(p);
for (j = 0; j < factors.num; j++)
{
if (n_powmod2_preinv(root, (p-1) / factors.p[j], p, pinv) == 1)
TEST_FUNCTION_FAIL("%wu ** (%wu / %wu) == 1 mod %wu\n", root, p-1, factors.p[j], p);
}
}
TEST_FUNCTION_END(state);
}