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
/*
Copyright (C) 2011 Fredrik Johansson
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 "nmod_vec.h"
#include "nmod_poly.h"
#include "arith.h"
void
arith_number_of_partitions_nmod_vec(nn_ptr res, slong len, nmod_t mod)
{
nn_ptr tmp;
ulong r;
slong k, n;
r = mod.n - UWORD(1);
if (len < 1)
return;
tmp = _nmod_vec_init(len);
_nmod_vec_zero(tmp, len);
tmp[0] = UWORD(1);
for (n = k = 1; n + 4*k + 2 < len; k += 2)
{
tmp[n] = r;
tmp[n + k] = r;
tmp[n + 3*k + 1] = UWORD(1);
tmp[n + 4*k + 2] = UWORD(1);
n += 6*k + 5;
}
if (n < len) tmp[n] = r;
if (n + k < len) tmp[n + k] = r;
if (n + 3*k + 1 < len) tmp[n + 3*k + 1] = WORD(1);
_nmod_poly_inv_series(res, tmp, len, len, mod);
_nmod_vec_clear(tmp);
}