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
|
/*=============================================================================
This file is part of FLINT.
FLINT is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
FLINT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with FLINT; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
=============================================================================*/
/******************************************************************************
Copyright (C) 2011 Fredrik Johansson
******************************************************************************/
#include "arith.h"
void
arith_bell_number_vec_recursive(fmpz * b, slong n)
{
slong i, k;
fmpz * t;
if (n < BELL_NUMBER_TAB_SIZE)
{
for (i = 0; i < n; i++)
fmpz_set_ui(b + i, bell_number_tab[i]);
return;
}
n -= 1;
t = _fmpz_vec_init(n);
fmpz_one(t);
fmpz_one(b);
fmpz_one(b + 1);
for (i = 1; i < n; i++)
{
fmpz_set(t + i, t);
for (k = i; k > 0; k--)
fmpz_add(t + k - 1, t + k - 1, t + k);
fmpz_set(b + i + 1, t);
}
_fmpz_vec_clear(t, n);
}
|
