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
|
/*
Copyright (C) 2016 Pascal Molin
This file is part of Arb.
Arb 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 2.1 of the License, or
(at your option) any later version. See <http://www.gnu.org/licenses/>.
*/
#include "dirichlet.h"
ulong
dirichlet_group_num_primitive(const dirichlet_group_t G)
{
if (G->q % 4 == 2)
return 0;
else
{
slong k;
ulong n = 1;
/* no overflow since result < G->q */
for (k = (G->neven == 2); k < G->num; k++)
{
ulong p = G->P[k].p, e = G->P[k].e;
if (e == 1)
n *= p - 2;
else
n *= (p * (p - 2) + 1) * n_pow(p, e - 2);
}
return n;
}
}
|
