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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
/*
Copyright (C) 2012 Fredrik Johansson
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 "arb_poly.h"
int main()
{
slong iter;
flint_rand_t state;
flint_printf("log1p_series....");
fflush(stdout);
flint_randinit(state);
/* compare with log_series */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_poly_t a, b, c;
slong m, n, prec;
prec = 2 + n_randint(state, 200);
m = n_randint(state, 10);
n = n_randint(state, 10);
arb_poly_init(a);
arb_poly_init(b);
arb_poly_init(c);
arb_poly_randtest(a, state, 1 + n_randint(state, 10), prec, 5);
arb_poly_randtest(b, state, 1 + n_randint(state, 10), prec, 5);
arb_poly_randtest(c, state, 1 + n_randint(state, 10), prec, 5);
if (n_randint(state, 2))
arb_poly_log1p_series(b, a, n, prec);
else
{
arb_poly_set(b, a);
arb_poly_log1p_series(b, b, n, prec);
}
arb_poly_add_si(c, a, 1, prec);
arb_poly_log_series(c, c, m, prec);
arb_poly_truncate(b, FLINT_MIN(m, n));
arb_poly_truncate(c, FLINT_MIN(m, n));
if (!arb_poly_overlaps(b, c))
{
flint_printf("FAIL\n\n");
flint_printf("m = %wd, n = %wd\n\n", m, n);
flint_printf("a = "); arb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); arb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("c = "); arb_poly_printd(c, 15); flint_printf("\n\n");
flint_abort();
}
arb_poly_clear(a);
arb_poly_clear(b);
arb_poly_clear(c);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
|
