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
/*
Copyright (C) 2011, 2021 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 "ulong_extras.h"
#include "nmod_vec.h"
#include "arith.h"
void
arith_bell_number_nmod_vec_recursive(nn_ptr b, slong n, nmod_t mod)
{
if (mod.n == 1 || n == 0)
{
_nmod_vec_zero(b, n);
return;
}
b[0] = 1;
if (n >= 2)
b[1] = 1;
if (n >= 3)
{
slong i, k;
nn_ptr t;
TMP_INIT;
TMP_START;
n -= 1;
t = TMP_ALLOC(n * sizeof(ulong));
t[0] = 1;
for (i = 1; i < n; i++)
{
t[i] = t[0];
for (k = i; k > 0; k--)
t[k - 1] = n_addmod(t[k - 1], t[k], mod.n);
b[i + 1] = t[0];
}
TMP_END;
}
}