flint-sys 0.9.0

Bindings to the FLINT C library
Documentation 
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

/*
    Copyright (C) 2011, 2021 William Hart
    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 "test_helpers.h"
#include "fmpz.h"
#include "fmpz_mod.h"
#include "fmpz_mod_poly.h"

TEST_FUNCTION_START(fmpz_mod_poly_invsqrt_series, state)
{
    int i, result;

    /* Check 1/g^2 = h mod x^m */
    for (i = 0; i < 100 * flint_test_multiplier(); i++)
    {
        fmpz_mod_poly_t h, g, r;
        slong m;
        fmpz_mod_ctx_t ctx;

        fmpz_mod_ctx_init_rand_bits_prime(ctx, state, FLINT_BITS);

        if (!fmpz_equal_ui(fmpz_mod_ctx_modulus(ctx), 2))
        {
            fmpz_mod_poly_init(h, ctx);
            fmpz_mod_poly_init(g, ctx);
            fmpz_mod_poly_init(r, ctx);

            do fmpz_mod_poly_randtest(h, state, n_randint(state, 1000), ctx);
            while (h->length == 0);
            fmpz_mod_poly_set_coeff_ui(h, 0, 1, ctx);

            m = n_randint(state, h->length) + 1;

            fmpz_mod_poly_invsqrt_series(g, h, m, ctx);

            fmpz_mod_poly_mullow(r, g, g, m, ctx);
            fmpz_mod_poly_inv_series(r, r, m, ctx);
            fmpz_mod_poly_truncate(h, m, ctx);

            result = (fmpz_cmp_ui(ctx->n, 2) == 0) || (fmpz_mod_poly_equal(r, h, ctx));
            if (!result)
            {
                flint_printf("FAIL:\n");
                fmpz_mod_poly_print(h, ctx), flint_printf("\n\n");
                fmpz_mod_poly_print(g, ctx), flint_printf("\n\n");
                fmpz_mod_poly_print(r, ctx), flint_printf("\n\n");
                flint_printf("n = ");
                fmpz_print(ctx->n);
                flint_printf("\n");
                fflush(stdout);
                flint_abort();
            }

            fmpz_mod_poly_clear(h, ctx);
            fmpz_mod_poly_clear(g, ctx);
            fmpz_mod_poly_clear(r, ctx);
        }

        fmpz_mod_ctx_clear(ctx);
    }

    /* Check aliasing of h and g */
    for (i = 0; i < 100 * flint_test_multiplier(); i++)
    {
        fmpz_mod_poly_t g, h;
        slong m;
        fmpz_mod_ctx_t ctx;

        fmpz_mod_ctx_init_rand_bits_prime(ctx, state, FLINT_BITS);

        if (!fmpz_equal_ui(fmpz_mod_ctx_modulus(ctx), 2))
        {
            fmpz_mod_poly_init(h, ctx);
            fmpz_mod_poly_init(g, ctx);

            do fmpz_mod_poly_randtest(h, state, n_randint(state, 500), ctx);
            while (h->length == 0);

            fmpz_mod_poly_set_coeff_ui(h, 0, 1, ctx);

            m = n_randint(state, h->length) + 1;

            fmpz_mod_poly_invsqrt_series(g, h, m, ctx);
            fmpz_mod_poly_invsqrt_series(h, h, m, ctx);

            result = (fmpz_cmp_ui(ctx->n, 2) == 0) || fmpz_mod_poly_equal(g, h, ctx);
            if (!result)
            {
                flint_printf("FAIL:\n");
                fmpz_mod_poly_print(h, ctx), flint_printf("\n\n");
                fmpz_mod_poly_print(g, ctx), flint_printf("\n\n");
                flint_printf("n = ");
                fmpz_print(ctx->n);
                flint_printf("\n");
                flint_printf("m = %wd\n", m);
                fflush(stdout);
                flint_abort();
            }

            fmpz_mod_poly_clear(g, ctx);
            fmpz_mod_poly_clear(h, ctx);
        }

        fmpz_mod_ctx_clear(ctx);
    }

    TEST_FUNCTION_END(state);
}