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

/*
    Copyright (C) 2018 Luca De Feo

    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/>.
*/

#ifdef T

#include "test_helpers.h"
#include "templates.h"
#include "fmpz.h"

TEST_TEMPLATE_FUNCTION_START(T, multiplicative_order, state)
{
    slong ix;
    int result;

    for (ix = 0; ix < 100 * flint_test_multiplier(); ix++)
    {
        TEMPLATE(T, ctx_t) ctx;
        TEMPLATE(T, t) a, X;
        fmpz_t ord;
        int type;

        type = n_randint(state, 2);

        /* Test big primes and small degrees */
        TEMPLATE(T, ctx_init_randtest)(ctx, state, 3);

        fmpz_init(ord);
        TEMPLATE(T, init)(a, ctx);
        TEMPLATE(T, init)(X, ctx);

        if (type == 0)
        {
            /* Check that multiplicative order is a multiple of the real one */
            TEMPLATE(T, randtest)(a, state, ctx);
            result = TEMPLATE(T, multiplicative_order)(ord, a, ctx);
            TEMPLATE(T, pow)(X, a, ord, ctx);

            if (result && !TEMPLATE(T, is_one)(X, ctx))
            {
                flint_printf("FAIL:\n\n");
                flint_printf("a = "), TEMPLATE(T, print_pretty)(a, ctx), flint_printf("\n");
                flint_printf("ord = "), fmpz_print(ord), flint_printf("\n");
                TEMPLATE(T, ctx_print)(ctx);
                flint_abort();
            }
        }
        else
        {
            /* Check multiplicative order is coherent with powering by p - 1 */
            fmpz_t size;
#if defined(FQ_NMOD_H) || defined(FQ_ZECH_H)
            ulong pm1;
#else
            fmpz_t pm1;
#endif

            fmpz_init(size);
#if !(defined(FQ_NMOD_H) || defined(FQ_ZECH_H))
            fmpz_init(pm1);
#endif
            TEMPLATE(T, gen)(X, ctx);
            if (TEMPLATE(T, is_primitive)(X, ctx))
            {
#if defined(FQ_NMOD_H) || defined(FQ_ZECH_H)
                pm1 = TEMPLATE(T, ctx_prime)(ctx) - 1;
                TEMPLATE(T, pow_ui)(a, X, pm1, ctx);
                result = TEMPLATE(T, multiplicative_order)(ord, a, ctx);
                fmpz_mul_ui(ord, ord, pm1);
#else
                fmpz_sub_ui(pm1, TEMPLATE(T, ctx_prime)(ctx), 1);
                TEMPLATE(T, pow)(a, X, pm1, ctx);
                result = TEMPLATE(T, multiplicative_order)(ord, a, ctx);
                fmpz_mul(ord, ord, pm1);
#endif

                TEMPLATE(T, ctx_order)(size, ctx);
                fmpz_sub(size, size, ord);

                if (result && !fmpz_is_one(size))
                {
                    flint_printf("FAIL:\n\n");
                    flint_printf("a = "), TEMPLATE(T, print_pretty)(a, ctx), flint_printf("\n");
                    flint_printf("ord = "), fmpz_print(ord), flint_printf("\n");
                    TEMPLATE(T, ctx_print)(ctx);
                    flint_abort();
                }
            }
#if !(defined(FQ_NMOD_H) || defined(FQ_ZECH_H))
            fmpz_clear(pm1);
#endif
            fmpz_clear(size);
        }

        fmpz_clear(ord);
        TEMPLATE(T, clear)(a, ctx);
        TEMPLATE(T, clear)(X, ctx);
        TEMPLATE(T, ctx_clear)(ctx);
    }

    TEST_FUNCTION_END(state);
}
#endif