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
/*
Copyright (C) 2009 William Hart
Copyright (C) 2024 Albin Ahlbäck
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"
TEST_FUNCTION_START(n_factor_power235, state)
{
slong ix;
int result;
for (ix = 0; ix < 3000 * flint_test_multiplier(); ix++)
{
ulong factor, exp, n1, n2, n1pow;
int bits;
ulong type;
type = n_randint(state, 4);
if (type == 0)
{
/* Test random squares */
bits = n_randint(state, FLINT_BITS / 2) + 1;
n1 = n_randtest_bits(state, bits);
n1pow = n1 * n1;
}
else if (type == 1)
{
/* Test random cubes */
bits = n_randint(state, FLINT_BITS / 3) + 1;
n1 = n_randtest_bits(state, bits);
n1pow = n1 * n1 * n1;
}
else if (type == 2)
{
/* Test random fifth powers */
bits = n_randint(state, FLINT_BITS / 5) + 1;
n1 = n_randtest_bits(state, bits);
n1pow = n1 * n1 * n1 * n1 * n1;
}
else
{
/* Test non 235-powers */
do
n1 = n_randtest(state);
while (n_is_perfect_power235(n1));
result = (!n_factor_power235(&exp, n1));
}
if (type < 3)
{
factor = n_factor_power235(&exp, n1pow);
n2 = n_pow(factor, exp);
result = (n1pow == n2);
}
if (!result)
TEST_FUNCTION_FAIL(
"type %d\n"
"n1 = %wu, exp = %wu\n",
type, n1, exp);
}
TEST_FUNCTION_END(state);
}