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

/*
    Copyright (C) 2019 Daniel Schultz

    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 "ulong_extras.h"
#include "nmod_poly.h"

TEST_FUNCTION_START(nmod_poly_find_distinct_nonzero_roots, state)
{
    slong i, j;

    for (i = 0; i < 200 * flint_test_multiplier(); i++)
    {
        int highdegreefactor;
        nmod_poly_t a, b, r;
        ulong p;

        p = n_randtest_prime(state, 1);

        nmod_poly_init(a, p);
        nmod_poly_init(b, p);
        nmod_poly_init(r, p);

        nmod_poly_zero(a);
        nmod_poly_set_coeff_ui(a, 0, 1 + n_randint(state, p - 1));
        highdegreefactor = 0;
        for (j = n_randint(state, 10); j >= 0; j--)
        {
            if (n_randint(state, 10) > 1)
            {
                nmod_poly_randtest_monic_irreducible(b, state, 1);
            }
            else
            {
                highdegreefactor = 1;
                nmod_poly_randtest_monic_irreducible(b, state, 2 + n_randint(state, 9));
            }
            nmod_poly_mul(a, a, b);
        }

        nmod_poly_fit_length(r, nmod_poly_degree(a));
        if (nmod_poly_find_distinct_nonzero_roots(r->coeffs, a))
        {
            /* check that a is square free */
            nmod_poly_derivative(b, a);
            nmod_poly_gcd(b, b, a);
            if (nmod_poly_degree(b) > 0)
            {
                flint_printf("FAIL\ncheck multiple roots i = %wd\n", i);
                fflush(stdout);
                flint_abort();
            }

            /* check that each root is a root */
            for (j = nmod_poly_degree(a) - 1; j >= 0; j--)
            {
                if (r->coeffs[j] == 0)
                {
                    flint_printf("FAIL\ncheck zero root i = %wd\n", i);
                    fflush(stdout);
                    flint_abort();
                }
                if (nmod_poly_evaluate_nmod(a, r->coeffs[j]) != 0)
                {
                    flint_printf("FAIL\ncheck root is a root i = %wd\n", i);
                    fflush(stdout);
                    flint_abort();
                }
            }
        }
        else
        {
            nmod_poly_derivative(b, a);
            nmod_poly_gcd(b, b, a);
            if (!highdegreefactor
                && nmod_poly_degree(b) == 0
                && nmod_poly_evaluate_nmod(a, 0) != 0)
            {
                flint_printf("FAIL\ncheck fail return i = %wd\n", i);
                fflush(stdout);
                flint_abort();
            }
        }

        nmod_poly_clear(a);
        nmod_poly_clear(b);
        nmod_poly_clear(r);
    }

    TEST_FUNCTION_END(state);
}