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

/*
    Copyright (C) 2009 William Hart

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

TEST_FUNCTION_START(n_remove2_precomp, state)
{
    int i, result;
    const ulong * primes;
    const double * inverses;

    primes = n_primes_arr_readonly(10000);
    inverses = n_prime_inverses_arr_readonly(10000);

    for (i = 0; i < 10000 * flint_test_multiplier(); i++) /* Test random numbers */
    {
        ulong n1, n2, orig_n;
        mpz_t d_n2, d_n1, d_p;
        int exp1, exp2;
        ulong j;

        mpz_init(d_n1);
        mpz_init(d_n2);
        mpz_init(d_p);

        n1 = n_randtest_not_zero(state);
        orig_n = n1;

        for (j = 0; j < FLINT_NUM_PRIMES_SMALL/10; j++)
        {
            flint_mpz_set_ui(d_n1, n1);
            flint_mpz_set_ui(d_p, flint_primes_small[j]);
            exp1 = n_remove2_precomp(&n1, primes[j], inverses[j]);
            exp2 = mpz_remove(d_n2, d_n1, d_p);
            n2 = flint_mpz_get_ui(d_n2);

            result = ((exp1 == exp2) && (n1 == n2));
            if (!result)
                TEST_FUNCTION_FAIL("n = %wu, exp1 = %d, exp2 = %d, n1 = %wu, n2 = %wu, p = %d\n", orig_n, exp1, exp2, n1, n2, flint_primes_small[j]);
        }

        mpz_clear(d_n1);
        mpz_clear(d_n2);
        mpz_clear(d_p);
    }

    for (i = 0; i < 10000 * flint_test_multiplier(); i++) /* Test perfect powers */
    {
        ulong n1, n2, orig_n, base;
        mpz_t d_n2, d_n1, d_p;
        int exp1, exp2, exp;
        ulong j;

        mpz_init(d_n1);
        mpz_init(d_n2);
        mpz_init(d_p);

        base = n_randtest_not_zero(state);
        n1 = base;
        exp = n_randint(state, FLINT_BITS/FLINT_BIT_COUNT(n1)) + 1;
        n1 = n_pow(base, exp);

        orig_n = n1;

        for (j = 0; j < FLINT_NUM_PRIMES_SMALL/10; j++)
        {
            flint_mpz_set_ui(d_n1, n1);
            flint_mpz_set_ui(d_p, flint_primes_small[j]);
            exp1 = n_remove2_precomp(&n1, primes[j], inverses[j]);
            exp2 = mpz_remove(d_n2, d_n1, d_p);
            n2 = flint_mpz_get_ui(d_n2);

            result = ((exp1 == exp2) && (n1 == n2));
            if (!result)
                TEST_FUNCTION_FAIL("n = %wu, exp1 = %d, exp2 = %d, n1 = %wu, n2 = %wu, p = %d\n", orig_n, exp1, exp2, n1, n2, flint_primes_small[j]);
        }

        mpz_clear(d_n1);
        mpz_clear(d_n2);
        mpz_clear(d_p);
    }

    TEST_FUNCTION_END(state);
}