int main()
{
slong iter;
flint_rand_t state;
flint_printf("overlaps....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t am, ar, bm, br, t, u;
int c1, c2;
arb_init(a);
arb_init(b);
fmpq_init(am);
fmpq_init(ar);
fmpq_init(bm);
fmpq_init(br);
fmpq_init(t);
fmpq_init(u);
arb_randtest(a, state, 1 + n_randint(state, 500), 14);
arb_randtest(b, state, 1 + n_randint(state, 500), 14);
arf_get_fmpq(am, arb_midref(a));
mag_get_fmpq(ar, arb_radref(a));
arf_get_fmpq(bm, arb_midref(b));
mag_get_fmpq(br, arb_radref(b));
fmpq_sub(t, am, bm);
fmpz_abs(fmpq_numref(t), fmpq_numref(t));
fmpq_add(u, ar, br);
c1 = arb_overlaps(a, b);
c2 = (fmpq_cmp(t, u) <= 0);
if (c1 != c2)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("am = "); fmpq_print(am); flint_printf("\n\n");
flint_printf("ar = "); fmpq_print(ar); flint_printf("\n\n");
flint_printf("bm = "); fmpq_print(bm); flint_printf("\n\n");
flint_printf("br = "); fmpq_print(br); flint_printf("\n\n");
flint_printf("t = "); fmpq_print(t); flint_printf("\n\n");
flint_printf("u = "); fmpq_print(u); flint_printf("\n\n");
flint_printf("c1 = %d, c2 = %d\n\n", c1, c2);
flint_abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(am);
fmpq_clear(ar);
fmpq_clear(bm);
fmpq_clear(br);
fmpq_clear(t);
fmpq_clear(u);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("tanh....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
arb_t x, y, a, b, c, d;
slong prec1, prec2;
prec1 = 2 + n_randint(state, 1000);
prec2 = prec1 + 30;
arb_init(x);
arb_init(y);
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_precise(x, state, 1 + n_randint(state, 1000), 100);
arb_randtest_precise(y, state, 1 + n_randint(state, 1000), 100);
arb_tanh(a, x, prec1);
arb_tanh(b, x, prec2);
/* check consistency */
if (!arb_overlaps(a, b))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
abort();
}
/* check tanh(x+y) = (tanh(x) + tanh(y)) / (1 + tanh(x) tanh(y)) */
arb_add(b, x, y, prec1);
arb_tanh(b, b, prec1);
arb_tanh(c, y, prec1);
arb_add(d, a, c, prec1);
arb_mul(c, a, c, prec1);
arb_add_ui(c, c, 1, prec1);
arb_div(d, d, c, prec1);
if (!arb_overlaps(b, d))
{
flint_printf("FAIL: functional equation\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("y = "); arb_print(y); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
abort();
}
arb_tanh(x, x, prec1);
if (!arb_overlaps(a, x))
{
flint_printf("FAIL: aliasing\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
abort();
}
arb_clear(x);
arb_clear(y);
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("frobenius_norm....");
fflush(stdout);
flint_randinit(state);
/* compare to the exact rational norm */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
fmpq_mat_t Q;
fmpq_t q;
arb_mat_t A;
slong n, qbits, prec;
n = n_randint(state, 8);
qbits = 1 + n_randint(state, 100);
prec = 2 + n_randint(state, 200);
fmpq_mat_init(Q, n, n);
fmpq_init(q);
arb_mat_init(A, n, n);
fmpq_mat_randtest(Q, state, qbits);
_fmpq_mat_sum_of_squares(q, Q);
arb_mat_set_fmpq_mat(A, Q, prec);
/* check that the arb interval contains the exact value */
{
arb_t a;
arb_init(a);
arb_mat_frobenius_norm(a, A, prec);
arb_mul(a, a, a, prec);
if (!arb_contains_fmpq(a, q))
{
flint_printf("FAIL (containment, iter = %wd)\n", iter);
flint_printf("n = %wd, prec = %wd\n", n, prec);
flint_printf("\n");
flint_printf("Q = \n");
fmpq_mat_print(Q);
flint_printf("\n\n");
flint_printf("frobenius_norm(Q)^2 = \n");
fmpq_print(q);
flint_printf("\n\n");
flint_printf("A = \n");
arb_mat_printd(A, 15);
flint_printf("\n\n");
flint_printf("frobenius_norm(A)^2 = \n");
arb_printd(a, 15);
flint_printf("\n\n");
flint_printf("frobenius_norm(A)^2 = \n");
arb_print(a);
flint_printf("\n\n");
abort();
}
arb_clear(a);
}
/* check that the upper bound is not less than the exact value */
{
mag_t b;
fmpq_t y;
mag_init(b);
fmpq_init(y);
arb_mat_bound_frobenius_norm(b, A);
mag_mul(b, b, b);
mag_get_fmpq(y, b);
if (fmpq_cmp(q, y) > 0)
{
flint_printf("FAIL (bound, iter = %wd)\n", iter);
flint_printf("n = %wd, prec = %wd\n", n, prec);
flint_printf("\n");
flint_printf("Q = \n");
fmpq_mat_print(Q);
flint_printf("\n\n");
flint_printf("frobenius_norm(Q)^2 = \n");
fmpq_print(q);
flint_printf("\n\n");
flint_printf("A = \n");
arb_mat_printd(A, 15);
flint_printf("\n\n");
flint_printf("bound_frobenius_norm(A)^2 = \n");
mag_printd(b, 15);
flint_printf("\n\n");
flint_printf("bound_frobenius_norm(A)^2 = \n");
mag_print(b);
flint_printf("\n\n");
abort();
}
mag_clear(b);
fmpq_clear(y);
}
fmpq_mat_clear(Q);
fmpq_clear(q);
arb_mat_clear(A);
}
/* check trace(A^T A) = frobenius_norm(A)^2 */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
slong m, n, prec;
arb_mat_t A, AT, ATA;
arb_t t;
prec = 2 + n_randint(state, 200);
m = n_randint(state, 10);
n = n_randint(state, 10);
arb_mat_init(A, m, n);
arb_mat_init(AT, n, m);
arb_mat_init(ATA, n, n);
arb_init(t);
arb_mat_randtest(A, state, 2 + n_randint(state, 100), 10);
arb_mat_transpose(AT, A);
arb_mat_mul(ATA, AT, A, prec);
arb_mat_trace(t, ATA, prec);
arb_sqrt(t, t, prec);
/* check the norm bound */
{
mag_t low, frobenius;
mag_init(low);
arb_get_mag_lower(low, t);
mag_init(frobenius);
arb_mat_bound_frobenius_norm(frobenius, A);
if (mag_cmp(low, frobenius) > 0)
{
flint_printf("FAIL (bound)\n", iter);
flint_printf("m = %wd, n = %wd, prec = %wd\n", m, n, prec);
flint_printf("\n");
flint_printf("A = \n");
arb_mat_printd(A, 15);
flint_printf("\n\n");
flint_printf("lower(sqrt(trace(A^T A))) = \n");
mag_printd(low, 15);
flint_printf("\n\n");
flint_printf("bound_frobenius_norm(A) = \n");
mag_printd(frobenius, 15);
flint_printf("\n\n");
abort();
}
mag_clear(low);
mag_clear(frobenius);
}
/* check the norm interval */
{
arb_t frobenius;
arb_init(frobenius);
arb_mat_frobenius_norm(frobenius, A, prec);
if (!arb_overlaps(t, frobenius))
{
flint_printf("FAIL (overlap)\n", iter);
flint_printf("m = %wd, n = %wd, prec = %wd\n", m, n, prec);
flint_printf("\n");
flint_printf("A = \n");
arb_mat_printd(A, 15);
flint_printf("\n\n");
flint_printf("sqrt(trace(A^T A)) = \n");
arb_printd(t, 15);
flint_printf("\n\n");
flint_printf("frobenius_norm(A) = \n");
arb_printd(frobenius, 15);
flint_printf("\n\n");
abort();
}
arb_clear(frobenius);
}
arb_mat_clear(A);
arb_mat_clear(AT);
arb_mat_clear(ATA);
arb_clear(t);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("bernoulli_poly_ui....");
fflush(stdout);
flint_randinit(state);
/* test multiplication theorem */
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
{
arb_t x, t, res1, res2;
ulong n, m, k;
slong prec;
n = n_randint(state, 50);
m = 1 + n_randint(state, 5);
prec = 2 + n_randint(state, 200);
arb_init(x);
arb_init(t);
arb_init(res1);
arb_init(res2);
arb_randtest(x, state, 2 + n_randint(state, 200), 20);
arb_randtest(res1, state, 2 + n_randint(state, 200), 20);
arb_mul_ui(t, x, m, prec);
arb_bernoulli_poly_ui(res1, n, t, prec);
arb_zero(res2);
for (k = 0; k < m; k++)
{
arb_set_ui(t, k);
arb_div_ui(t, t, m, prec);
arb_add(t, t, x, prec);
arb_bernoulli_poly_ui(t, n, t, prec);
arb_add(res2, res2, t, prec);
}
if (n > 0)
{
arb_ui_pow_ui(t, m, n - 1, prec);
arb_mul(res2, res2, t, prec);
}
else
{
arb_div_ui(res2, res2, m, prec);
}
if (!arb_overlaps(res1, res2))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("n = %wu, m = %wu\n\n", n, m);
flint_printf("x = "); arb_printd(x, 15); flint_printf("\n\n");
flint_printf("res1 = "); arb_printd(res1, 15); flint_printf("\n\n");
flint_printf("res2 = "); arb_printd(res2, 15); flint_printf("\n\n");
abort();
}
arb_clear(x);
arb_clear(t);
arb_clear(res1);
arb_clear(res2);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("gamma_fmpq....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
arb_t r, s;
fmpq_t q;
slong accuracy, prec, pp, qq;
prec = 2 + n_randint(state, 1 << n_randint(state, 12));
prec += 20;
arb_init(r);
arb_init(s);
fmpq_init(q);
pp = -100 + n_randint(state, 10000);
qq = 1 + n_randint(state, 20);
fmpq_set_si(q, pp, qq);
arb_gamma_fmpq(r, q, prec);
arb_set_fmpq(s, q, prec);
arb_gamma(s, s, prec);
if (!arb_overlaps(r, s))
{
flint_printf("FAIL: containment\n\n");
flint_printf("prec = %wd\n", prec);
flint_printf("q = ");
fmpq_print(q);
flint_printf("\n\n");
flint_printf("r = ");
arb_printd(r, prec / 3.33);
flint_printf("\n\n");
flint_printf("s = ");
arb_printd(s, prec / 3.33);
flint_printf("\n\n");
abort();
}
if (!(fmpz_is_one(fmpq_denref(q)) && fmpz_sgn(fmpq_numref(q)) <= 0)
&& FLINT_ABS(pp / qq) < 10)
{
accuracy = arb_rel_accuracy_bits(r);
if (accuracy < prec - 6)
{
flint_printf("FAIL: poor accuracy\n\n");
flint_printf("prec = %wd\n", prec);
flint_printf("q = ");
fmpq_print(q);
flint_printf("\n\n");
flint_printf("r = ");
arb_printd(r, prec / 3.33);
flint_printf("\n\n");
abort();
}
}
arb_clear(r);
arb_clear(s);
fmpq_clear(q);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("atanh....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
arb_t x, a, b;
slong prec1, prec2;
prec1 = 2 + n_randint(state, 1000);
prec2 = prec1 + 30;
arb_init(x);
arb_init(a);
arb_init(b);
arb_randtest_special(x, state, 1 + n_randint(state, 1000), 2 + n_randint(state, 100));
arb_randtest_special(a, state, 1 + n_randint(state, 1000), 2 + n_randint(state, 100));
arb_randtest_special(b, state, 1 + n_randint(state, 1000), 2 + n_randint(state, 100));
arb_atanh(a, x, prec1);
arb_atanh(b, x, prec2);
/* check consistency */
if (!arb_overlaps(a, b))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("x = "); arb_printd(x, 15); flint_printf("\n\n");
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); arb_printd(b, 15); flint_printf("\n\n");
abort();
}
/* check tanh(atanh(x)) = x */
arb_tanh(b, b, prec1);
if (!arb_contains(b, x))
{
flint_printf("FAIL: functional equation\n\n");
flint_printf("x = "); arb_printd(x, 15); flint_printf("\n\n");
flint_printf("b = "); arb_printd(b, 15); flint_printf("\n\n");
abort();
}
arb_atanh(x, x, prec1);
if (!arb_overlaps(a, x))
{
flint_printf("FAIL: aliasing\n\n");
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("x = "); arb_printd(x, 15); flint_printf("\n\n");
abort();
}
arb_clear(x);
arb_clear(a);
arb_clear(b);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("sqrt1pm1....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 20000; iter++)
{
arb_t a, b, c, d;
slong prec0, prec1, prec2;
if (iter % 10 == 0)
prec0 = 10000;
else
prec0 = 1000;
prec1 = 2 + n_randint(state, prec0);
prec2 = 2 + n_randint(state, prec0);
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_special(a, state, 1 + n_randint(state, prec0), 100);
arb_randtest_special(b, state, 1 + n_randint(state, prec0), 100);
arb_randtest_special(c, state, 1 + n_randint(state, prec0), 100);
arb_sqrt1pm1(b, a, prec1);
arb_sqrt1pm1(c, a, prec2);
if (!arb_overlaps(b, c))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
abort();
}
/* compare with sqrt */
arb_add_ui(d, a, 1, prec2);
arb_sqrt(d, d, prec2);
arb_sub_ui(d, d, 1, prec2);
if (!arb_overlaps(c, d))
{
flint_printf("FAIL: comparison with log\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
abort();
}
arb_sqrt1pm1(a, a, prec1);
if (!arb_overlaps(a, b))
{
flint_printf("FAIL: aliasing\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
long iter;
flint_rand_t state;
printf("pow....");
fflush(stdout);
flint_randinit(state);
/* check large arguments */
for (iter = 0; iter < 20000; iter++)
{
arb_t a, b, c, d, e, f;
long prec1, prec2;
prec1 = 2 + n_randint(state, 1000);
prec2 = prec1 + 30;
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_init(e);
arb_init(f);
arb_randtest(a, state, 1 + n_randint(state, 1000), 200);
arb_randtest(b, state, 1 + n_randint(state, 1000), 200);
arb_pow(c, a, b, prec1);
arb_pow(d, a, b, prec2);
if (!arb_overlaps(c, d))
{
printf("FAIL: overlap\n\n");
printf("a = "); arb_print(a); printf("\n\n");
printf("b = "); arb_print(b); printf("\n\n");
printf("c = "); arb_print(c); printf("\n\n");
printf("d = "); arb_print(d); printf("\n\n");
abort();
}
arb_randtest(c, state, 1 + n_randint(state, 1000), 200);
/* check a^(b+c) = a^b*a^c */
arb_add(e, b, c, prec1);
arb_pow(d, a, e, prec1);
arb_pow(e, a, b, prec1);
arb_pow(f, a, c, prec1);
arb_mul(e, e, f, prec1);
if (!arb_overlaps(d, e))
{
printf("FAIL: functional equation\n\n");
printf("a = "); arb_print(a); printf("\n\n");
printf("b = "); arb_print(b); printf("\n\n");
printf("c = "); arb_print(c); printf("\n\n");
printf("d = "); arb_print(d); printf("\n\n");
printf("e = "); arb_print(e); printf("\n\n");
abort();
}
arb_pow(c, a, b, prec1);
arb_set(d, a);
arb_pow(d, d, b, prec2);
if (!arb_overlaps(c, d))
{
printf("FAIL: aliasing 1\n\n");
printf("a = "); arb_print(a); printf("\n\n");
printf("b = "); arb_print(b); printf("\n\n");
printf("c = "); arb_print(c); printf("\n\n");
printf("d = "); arb_print(d); printf("\n\n");
abort();
}
arb_set(d, b);
arb_pow(d, a, d, prec2);
if (!arb_overlaps(c, d))
{
printf("FAIL: aliasing 2\n\n");
printf("a = "); arb_print(a); printf("\n\n");
printf("b = "); arb_print(b); printf("\n\n");
printf("c = "); arb_print(c); printf("\n\n");
printf("d = "); arb_print(d); printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
arb_clear(e);
arb_clear(f);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("exp_arf_bb....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 5000 * arb_test_multiplier(); iter++)
{
arb_t x, y, z;
slong prec = 2 + n_randint(state, 8000);
arb_init(x);
arb_init(y);
arb_init(z);
arb_randtest(x, state, 1 + n_randint(state, 8000), 3);
mag_zero(arb_radref(x));
if (n_randint(state, 2))
{
if ((FLINT_BITS == 64) && (sizeof(mpfr_exp_t) >= sizeof(slong)))
arb_mul_2exp_si(x, x, 1 + n_randint(state, 40));
else
arb_mul_2exp_si(x, x, 1 + n_randint(state, 20));
}
else
{
arb_mul_2exp_si(x, x, -n_randint(state, 1.5 * prec));
}
arb_exp_arf_via_mpfr(y, arb_midref(x), prec + 100);
arb_exp_arf_bb(z, arb_midref(x), prec, 0);
if (!arb_contains(z, y))
{
flint_printf("FAIL: containment\n\n");
flint_printf("prec = %wd\n\n", prec);
flint_printf("x = "); arb_printd(x, 50); flint_printf("\n\n");
flint_printf("y = "); arb_printd(y, 50); flint_printf("\n\n");
flint_printf("z = "); arb_printd(z, 50); flint_printf("\n\n");
flint_abort();
}
if (arb_rel_accuracy_bits(z) < prec - 2)
{
flint_printf("FAIL: poor accuracy\n\n");
flint_printf("prec = %wd, acc = %wd\n\n", prec, arb_rel_accuracy_bits(z));
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("y = "); arb_print(y); flint_printf("\n\n");
flint_printf("z = "); arb_print(z); flint_printf("\n\n");
flint_abort();
}
arb_exp_arf_bb(x, arb_midref(x), prec, 0);
if (!arb_overlaps(x, z))
{
flint_printf("FAIL: aliasing\n\n");
flint_abort();
}
arb_clear(x);
arb_clear(y);
arb_clear(z);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("central_bin_ui....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
{
arb_t b1, b2, t;
ulong n;
slong prec1, prec2, acc1;
n = n_randtest(state);
prec1 = 2 + n_randint(state, 1000);
prec2 = prec1 + 30;
arb_init(b1);
arb_init(b2);
arb_init(t);
arb_hypgeom_central_bin_ui(b1, n, prec1);
arb_set_ui(t, n);
arb_add_ui(t, t, n, prec2);
arb_add_ui(t, t, 1, prec2);
arb_gamma(t, t, prec2);
arb_set_ui(b2, n);
arb_add_ui(b2, b2, 1, prec2);
arb_rgamma(b2, b2, prec2);
arb_mul(b2, b2, b2, prec2);
arb_mul(b2, b2, t, prec2);
if (!arb_overlaps(b1, b2))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("n = %wu\n\n", n);
flint_printf("b1 = "); arb_printn(b1, 50, 0); flint_printf("\n\n");
flint_printf("b2 = "); arb_printn(b2, 50, 0); flint_printf("\n\n");
flint_abort();
}
acc1 = arb_rel_accuracy_bits(b1);
if (acc1 < prec1 - 2)
{
flint_printf("FAIL: poor accuracy\n\n");
flint_printf("prec1 = %wd, acc1 = %wd\n", prec1, acc1);
flint_printf("b1 = "); arb_printn(b1, prec1 / 3.33, 0); flint_printf("\n\n");
flint_printf("b2 = "); arb_printn(b2, prec2 / 3.33, 0); flint_printf("\n\n");
flint_abort();
}
arb_clear(b1);
arb_clear(b2);
arb_clear(t);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("hurwitz_zeta....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c;
acb_t d, e, f;
slong prec;
prec = 2 + n_randint(state, 300);
arb_init(a);
arb_init(b);
arb_init(c);
acb_init(d);
acb_init(e);
acb_init(f);
arb_randtest_precise(a, state, 1 + n_randint(state, 300), 5);
arb_randtest_precise(b, state, 1 + n_randint(state, 300), 5);
arb_randtest_precise(c, state, 1 + n_randint(state, 300), 5);
acb_set_arb(d, a);
acb_set_arb(e, b);
arb_hurwitz_zeta(c, a, b, prec);
acb_hurwitz_zeta(f, d, e, prec);
if (!arb_overlaps(c, acb_realref(f)) ||
(arb_is_finite(c) && !arb_contains_zero(acb_imagref(f))))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); arb_printd(b, 15); flint_printf("\n\n");
flint_printf("c = "); arb_printd(c, 15); flint_printf("\n\n");
flint_printf("d = "); acb_printd(d, 15); flint_printf("\n\n");
flint_printf("e = "); acb_printd(e, 15); flint_printf("\n\n");
flint_printf("f = "); acb_printd(f, 15); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
acb_clear(d);
acb_clear(e);
acb_clear(f);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("atan....");
fflush(stdout);
flint_randinit(state);
/* Compare with MPFR */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t q;
mpfr_t t;
slong prec = 2 + n_randint(state, 200);
arb_init(a);
arb_init(b);
fmpq_init(q);
mpfr_init2(t, prec + 100);
arb_randtest(a, state, 1 + n_randint(state, 200), 3);
arb_randtest(b, state, 1 + n_randint(state, 200), 3);
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, 200));
fmpq_get_mpfr(t, q, MPFR_RNDN);
mpfr_atan(t, t, MPFR_RNDN);
arb_atan(b, a, prec);
if (!arb_contains_mpfr(b, t))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_abort();
}
arb_atan(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(q);
mpfr_clear(t);
}
/* Check large arguments. */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c, d;
slong prec1, prec2;
prec1 = 2 + n_randint(state, 1000);
prec2 = prec1 + 30;
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_precise(a, state, 1 + n_randint(state, 1000), 100);
arb_atan(b, a, prec1);
arb_atan(c, a, prec2);
if (!arb_overlaps(b, c))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_abort();
}
/* check tan(atan(x)) = x */
arb_sin_cos(c, d, b, prec1);
arb_div(c, c, d, prec1);
if (!arb_contains(c, a))
{
flint_printf("FAIL: functional equation\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
/* Compare with MPFR, higher precision. */
for (iter = 0; iter < 200 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t q;
mpfr_t t;
slong prec = 2 + n_randint(state, 5000);
arb_init(a);
arb_init(b);
fmpq_init(q);
mpfr_init2(t, prec + 100);
arb_randtest(a, state, 1 + n_randint(state, 5000), 8);
arb_randtest(b, state, 1 + n_randint(state, 5000), 8);
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, 200));
fmpq_get_mpfr(t, q, MPFR_RNDN);
mpfr_atan(t, t, MPFR_RNDN);
arb_atan(b, a, prec);
if (!arb_contains_mpfr(b, t))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("a = "); arb_printd(a, 50); flint_printf("\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_printd(b, 50); flint_printf("\n\n");
flint_abort();
}
arb_atan(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(q);
mpfr_clear(t);
}
/* Higher precision + large arguments. */
for (iter = 0; iter < 2000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c, d;
slong prec1, prec2;
prec1 = 2 + n_randint(state, 5000);
prec2 = prec1 + 30;
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_precise(a, state, 1 + n_randint(state, 5000), 100);
arb_atan(b, a, prec1);
arb_atan(c, a, prec2);
if (!arb_overlaps(b, c))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_abort();
}
/* check tan(atan(x)) = x */
arb_sin_cos(c, d, b, prec1);
arb_div(c, c, d, prec1);
if (!arb_contains(c, a))
{
flint_printf("FAIL: functional equation\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
/* Check wide arguments. */
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c, d;
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_precise(a, state, 1 + n_randint(state, 1000), 100);
arb_randtest_precise(b, state, 1 + n_randint(state, 1000), 100);
if (n_randint(state, 2))
arb_add(a, a, b, 2 + n_randint(state, 1000));
arb_union(d, a, b, 2 + n_randint(state, 1000));
arb_atan(a, a, 2 + n_randint(state, 2000));
arb_atan(b, b, 2 + n_randint(state, 2000));
arb_atan(c, d, 2 + n_randint(state, 2000));
if (!arb_overlaps(c, a) || !arb_overlaps(c, b))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("rising2_ui....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
{
arb_t a, u, v, u2, v2;
fmpz *f;
arb_ptr g;
ulong n;
slong i, prec;
arb_init(a);
arb_init(u);
arb_init(v);
arb_init(u2);
arb_init(v2);
arb_randtest(a, state, 1 + n_randint(state, 4000), 10);
arb_randtest(u, state, 1 + n_randint(state, 4000), 10);
arb_randtest(v, state, 1 + n_randint(state, 4000), 10);
n = n_randint(state, 120);
f = _fmpz_vec_init(n + 1);
g = _arb_vec_init(n + 1);
prec = 2 + n_randint(state, 4000);
arb_rising2_ui(u, v, a, n, prec);
arith_stirling_number_1u_vec(f, n, n + 1);
for (i = 0; i <= n; i++)
arb_set_fmpz(g + i, f + i);
_arb_poly_evaluate(u2, g, n + 1, a, prec);
_arb_poly_derivative(g, g, n + 1, prec);
_arb_poly_evaluate(v2, g, n, a, prec);
if (!arb_overlaps(u, u2) || !arb_overlaps(v, v2))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("n = %wu\n", n);
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("u = "); arb_printd(u, 15); flint_printf("\n\n");
flint_printf("u2 = "); arb_printd(u2, 15); flint_printf("\n\n");
flint_printf("v = "); arb_printd(v, 15); flint_printf("\n\n");
flint_printf("v2 = "); arb_printd(v2, 15); flint_printf("\n\n");
flint_abort();
}
arb_set(u2, a);
arb_rising2_ui(u2, v, u2, n, prec);
if (!arb_equal(u2, u))
{
flint_printf("FAIL: aliasing 1\n\n");
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("u = "); arb_printd(u, 15); flint_printf("\n\n");
flint_printf("u2 = "); arb_printd(u2, 15); flint_printf("\n\n");
flint_printf("n = %wu\n", n);
flint_abort();
}
arb_set(v2, a);
arb_rising2_ui(u, v2, v2, n, prec);
if (!arb_equal(v2, v))
{
flint_printf("FAIL: aliasing 2\n\n");
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("v = "); arb_printd(v, 15); flint_printf("\n\n");
flint_printf("v2 = "); arb_printd(v2, 15); flint_printf("\n\n");
flint_printf("n = %wu\n", n);
flint_abort();
}
arb_clear(a);
arb_clear(u);
arb_clear(v);
arb_clear(u2);
arb_clear(v2);
_fmpz_vec_clear(f, n + 1);
_arb_vec_clear(g, n + 1);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
long iter;
flint_rand_t state;
printf("atan_arf_bb....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 5000; iter++)
{
arb_t x, y, z;
long prec, prec2;
arb_init(x);
arb_init(y);
arb_init(z);
prec = 2 + n_randint(state, 8000);
arb_randtest(x, state, 1 + n_randint(state, 8000), 3);
mag_zero(arb_radref(x));
if (n_randint(state, 2))
arb_mul_2exp_si(x, x, 1 + n_randint(state, 40));
else
arb_mul_2exp_si(x, x, -n_randint(state, 1.5 * prec));
if (!arf_is_special(arb_midref(x)))
prec2 = prec + 100 + 2 * (-ARF_EXP(arb_midref(x)));
else
prec2 = prec + 100;
arb_atan_arf_via_mpfr(y, arb_midref(x), prec2);
arb_atan_arf_bb(z, arb_midref(x), prec);
if (!arb_contains(z, y))
{
printf("FAIL: containment\n\n");
printf("prec = %ld\n\n", prec);
printf("x = "); arb_printd(x, 50); printf("\n\n");
printf("y = "); arb_printd(y, 50); printf("\n\n");
printf("z = "); arb_printd(z, 50); printf("\n\n");
abort();
}
if (arb_rel_accuracy_bits(z) < prec - 2)
{
printf("FAIL: poor accuracy\n\n");
printf("prec = %ld, acc = %ld\n\n", prec, arb_rel_accuracy_bits(z));
printf("x = "); arb_printd(x, 50); printf("\n\n");
printf("y = "); arb_printd(y, 50); printf("\n\n");
printf("z = "); arb_printd(z, 50); printf("\n\n");
abort();
}
arb_atan_arf_bb(x, arb_midref(x), prec);
if (!arb_overlaps(x, z))
{
printf("FAIL: aliasing\n\n");
abort();
}
arb_clear(x);
arb_clear(y);
arb_clear(z);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("pow_fmpq....");
fflush(stdout);
flint_randinit(state);
/* check large arguments */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c, d;
fmpq_t e1, e2, e3;
slong prec1, prec2;
prec1 = 2 + n_randint(state, 1000);
prec2 = prec1 + 30;
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
fmpq_init(e1);
fmpq_init(e2);
fmpq_init(e3);
arb_randtest_precise(a, state, 1 + n_randint(state, 1000), 200);
arb_randtest_precise(b, state, 1 + n_randint(state, 1000), 200);
fmpq_randtest(e1, state, 200);
fmpq_randtest(e2, state, 200);
arb_pow_fmpq(b, a, e1, prec1);
arb_pow_fmpq(c, a, e1, prec2);
if (!arb_overlaps(b, c))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("e1 = "); fmpq_print(e1); flint_printf("\n\n");
abort();
}
/* check a^(e1+e2) = a^e1*a^e2 */
arb_pow_fmpq(c, a, e2, prec1);
arb_mul(d, b, c, prec1);
fmpq_add(e3, e1, e2);
arb_pow_fmpq(c, a, e3, prec1);
if (!arb_overlaps(c, d))
{
flint_printf("FAIL: functional equation\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
flint_printf("e1 = "); fmpq_print(e1); flint_printf("\n\n");
flint_printf("e2 = "); fmpq_print(e2); flint_printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
fmpq_clear(e1);
fmpq_clear(e2);
fmpq_clear(e3);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("log_arf....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 5000; iter++)
{
arf_t x;
arb_t y1, y2;
slong prec1, prec2, acc1, acc2;
prec1 = 2 + n_randint(state, 9000);
prec2 = 2 + n_randint(state, 9000);
arf_init(x);
arb_init(y1);
arb_init(y2);
arf_randtest_special(x, state, 1 + n_randint(state, 9000), 200);
arb_randtest_special(y1, state, 1 + n_randint(state, 9000), 200);
arb_randtest_special(y2, state, 1 + n_randint(state, 9000), 200);
if (n_randint(state, 2))
arf_add_ui(x, x, 1, 2 + n_randint(state, 9000), ARF_RND_DOWN);
arb_log_arf(y1, x, prec1);
arb_log_arf(y2, x, prec2);
if (!arb_overlaps(y1, y2))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("prec1 = %wd, prec2 = %wd\n\n", prec1, prec2);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y1 = "); arb_print(y1); flint_printf("\n\n");
flint_printf("y2 = "); arb_print(y2); flint_printf("\n\n");
abort();
}
acc1 = arb_rel_accuracy_bits(y1);
acc2 = arb_rel_accuracy_bits(y2);
if (arf_sgn(x) > 0)
{
if (acc1 < prec1 - 2 || acc2 < prec2 - 2)
{
flint_printf("FAIL: accuracy\n\n");
flint_printf("prec1 = %wd, prec2 = %wd\n\n", prec1, prec2);
flint_printf("acc1 = %wd, acc2 = %wd\n\n", acc1, acc2);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y1 = "); arb_print(y1); flint_printf("\n\n");
flint_printf("y2 = "); arb_print(y2); flint_printf("\n\n");
abort();
}
}
arf_clear(x);
arb_clear(y1);
arb_clear(y2);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("exp....");
fflush(stdout);
flint_randinit(state);
/* check large arguments + compare with exp_simple */
for (iter = 0; iter < 100000 *arb_test_multiplier(); iter++)
{
arb_t a, b, c, d;
slong prec0, prec1, prec2, acc1, acc2;
if (iter % 10 == 0)
prec0 = 10000;
else
prec0 = 1000;
prec1 = 2 + n_randint(state, prec0);
prec2 = 2 + n_randint(state, prec0);
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_special(a, state, 1 + n_randint(state, prec0), 100);
arb_randtest_special(b, state, 1 + n_randint(state, prec0), 100);
arb_exp(b, a, prec1);
arb_exp(c, a, prec2);
arb_exp_simple(d, a, prec1);
if (!arb_overlaps(b, c) || !arb_overlaps(b, d) || !arb_overlaps(c, d))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
flint_abort();
}
/* compare accuracy with exp_simple */
acc1 = arb_rel_accuracy_bits(b);
acc2 = arb_rel_accuracy_bits(d);
if (acc2 > 0 && acc1 < acc2 - 1)
{
flint_printf("FAIL: accuracy\n\n");
flint_printf("prec1 = %wd, acc1 = %wd, acc2 = %wd\n\n", prec1, acc1, acc2);
flint_printf("a = "); arb_printd(a, 50); flint_printf("\n\n");
flint_printf("b = "); arb_printd(b, 50); flint_printf("\n\n");
flint_printf("d = "); arb_printd(d, 50); flint_printf("\n\n");
flint_abort();
}
arb_randtest_special(b, state, 1 + n_randint(state, prec0), 100);
/* check exp(a)*exp(b) = exp(a+b) */
arb_exp(c, a, prec1);
arb_exp(d, b, prec1);
arb_mul(c, c, d, prec1);
arb_add(d, a, b, prec1);
arb_exp(d, d, prec1);
if (!arb_overlaps(c, d))
{
flint_printf("FAIL: functional equation\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
/* test union */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c, d, e;
slong prec0, prec1, prec2, prec3, prec4;
if (iter % 10 == 0)
prec0 = 10000;
else
prec0 = 1000;
prec1 = 2 + n_randint(state, prec0);
prec2 = 2 + n_randint(state, prec0);
prec3 = 2 + n_randint(state, prec0);
prec4 = 2 + n_randint(state, prec0);
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_init(e);
arb_randtest_special(a, state, 1 + n_randint(state, prec0), 200);
arb_randtest_special(b, state, 1 + n_randint(state, prec0), 200);
arb_randtest_special(c, state, 1 + n_randint(state, prec0), 200);
arb_randtest_special(d, state, 1 + n_randint(state, prec0), 200);
arb_randtest_special(e, state, 1 + n_randint(state, prec0), 200);
arb_exp(c, a, prec1);
arb_exp(d, b, prec2);
arb_union(e, a, b, prec3);
arb_exp(e, e, prec4);
if (!arb_overlaps(e, c) || !arb_overlaps(e, d))
{
flint_printf("FAIL: union\n\n");
flint_printf("a = "); arb_printn(a, 1000, 0); flint_printf("\n\n");
flint_printf("b = "); arb_printn(b, 1000, 0); flint_printf("\n\n");
flint_printf("c = "); arb_printn(c, 1000, 0); flint_printf("\n\n");
flint_printf("d = "); arb_printn(d, 1000, 0); flint_printf("\n\n");
flint_printf("e = "); arb_printn(e, 1000, 0); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
arb_clear(e);
}
/* comparison with mpfr */
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t q;
mpfr_t t;
slong prec0, prec;
prec0 = 400;
if (iter % 100 == 0)
prec0 = 10000;
prec = 2 + n_randint(state, prec0);
arb_init(a);
arb_init(b);
fmpq_init(q);
mpfr_init2(t, prec + 100);
arb_randtest(a, state, 1 + n_randint(state, prec0), 4);
arb_randtest(b, state, 1 + n_randint(state, prec0), 4);
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, prec0));
fmpq_get_mpfr(t, q, MPFR_RNDN);
mpfr_exp(t, t, MPFR_RNDN);
arb_exp(b, a, prec);
if (!arb_contains_mpfr(b, t))
{
flint_printf("FAIL: containment\n\n");
flint_printf("iter = %wd, prec = %wd\n\n", iter, prec);
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_abort();
}
arb_exp(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
flint_printf("iter = %wd, prec = %wd\n\n", iter, prec);
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(q);
mpfr_clear(t);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
