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
118

/*
    Copyright (C) 2011 Sebastian Pancratz

    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 "fmpz.h"

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

    /* Random values */
    for (i = 0; i < 1000 * flint_test_multiplier(); i++)
    {
        fmpz_t a, b, q, p;
        int divides;
        int aliasing;

        fmpz_init(a);
        fmpz_init(b);
        fmpz_init(p);
        fmpz_init(q);

        fmpz_randtest(a, state, 200);
        fmpz_randtest(b, state, 200);

        aliasing = n_randint(state, 4);

        if (aliasing == 0)
        {
            divides = fmpz_divides(q, b, a);
        }
        else if (aliasing == 1)
        {
            fmpz_set(b, a);
            divides = fmpz_divides(q, b, b);
        }
        else if (aliasing == 2)
        {
            fmpz_set(q, b);
            divides = fmpz_divides(q, q, a);
        }
        else
        {
            fmpz_set(q, a);
            divides = fmpz_divides(q, b, q);
        }

        fmpz_mul(p, a, q);

        result = ((divides && fmpz_equal(p, b)) ||
	         (!divides && fmpz_is_zero(q) && !fmpz_equal(p, b)));
        result = result && _fmpz_is_canonical(q);
        if (!result)
        {
            flint_printf("FAIL:\n");
            flint_printf("divides = %d\n", divides);
            flint_printf("a = "); fmpz_print(a); flint_printf("\n");
            flint_printf("b = "); fmpz_print(b); flint_printf("\n");
            flint_printf("p = "); fmpz_print(p); flint_printf("\n");
            flint_printf("q = "); fmpz_print(q); flint_printf("\n");
            fflush(stdout);
            flint_abort();
        }

        fmpz_clear(a);
        fmpz_clear(b);
        fmpz_clear(p);
        fmpz_clear(q);
    }

    /* Random b multiple of a */
    for (i = 0; i < 1000 * flint_test_multiplier(); i++)
    {
        fmpz_t a, b, q, p;
        int divides;

        fmpz_init(a);
        fmpz_init(b);
        fmpz_init(p);
        fmpz_init(q);

        fmpz_randtest(a, state, 200);
        fmpz_randtest(b, state, 200);
        fmpz_mul(b, a, b);

        divides = fmpz_divides(q, b, a);
        fmpz_mul(p, a, q);

        result = (divides && fmpz_equal(p, b));
        if (!result)
        {
            flint_printf("FAIL:\n");
            flint_printf("divides = %d\n", divides);
            flint_printf("a = "); fmpz_print(a); flint_printf("\n");
            flint_printf("b = "); fmpz_print(b); flint_printf("\n");
            flint_printf("p = "); fmpz_print(p); flint_printf("\n");
            flint_printf("q = "); fmpz_print(q); flint_printf("\n");
            fflush(stdout);
            flint_abort();
        }

        fmpz_clear(a);
        fmpz_clear(b);
        fmpz_clear(p);
        fmpz_clear(q);
    }

    TEST_FUNCTION_END(state);
}