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
|
/* Exercise mpz_fac_ui and mpz_2fac_ui.
Copyright 2000-2002, 2012, 2015 Free Software Foundation, Inc.
This file is part of the GNU MP Library test suite.
The GNU MP Library test suite is free software; you can redistribute it
and/or modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 3 of the License,
or (at your option) any later version.
The GNU MP Library test suite is distributed in the hope that it will be
useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
Public License for more details.
You should have received a copy of the GNU General Public License along with
the GNU MP Library test suite. If not, see https://www.gnu.org/licenses/. */
#include <stdio.h>
#include <stdlib.h>
#include "gmp-impl.h"
#include "tests.h"
/* Usage: t-fac_ui [x|num]
With no arguments testing goes up to the initial value of "limit" below.
With a number argument tests are carried that far, or with a literal "x"
tests are continued without limit (this being meant only for development
purposes). */
int
main (int argc, char *argv[])
{
unsigned long n, m;
unsigned long limit = 2222;
mpz_t df[2], f, r;
tests_start ();
if (argc > 1 && argv[1][0] == 'x')
limit = ULONG_MAX;
else
TESTS_REPS (limit, argv, argc);
/* for small limb testing */
limit = MIN (limit, MP_LIMB_T_MAX);
mpz_init_set_ui (df[0], 1); /* 0!! = 1 */
mpz_init_set_ui (df[1], 1); /* -1!! = 1 */
mpz_init_set_ui (f, 1); /* 0! = 1 */
mpz_init (r);
for (n = 0, m = 0; n < limit; n++)
{
mpz_fac_ui (r, n);
MPZ_CHECK_FORMAT (r);
if (mpz_cmp (f, r) != 0)
{
printf ("mpz_fac_ui(%lu) wrong\n", n);
printf (" got "); mpz_out_str (stdout, 10, r); printf("\n");
printf (" want "); mpz_out_str (stdout, 10, f); printf("\n");
abort ();
}
mpz_2fac_ui (r, n);
MPZ_CHECK_FORMAT (r);
if (mpz_cmp (df[m], r) != 0)
{
printf ("mpz_2fac_ui(%lu) wrong\n", n);
printf (" got "); mpz_out_str (stdout, 10, r); printf("\n");
printf (" want "); mpz_out_str (stdout, 10, df[m]); printf("\n");
abort ();
}
m ^= 1;
mpz_mul_ui (df[m], df[m], n+1); /* (n+1)!! = (n-1)!! * (n+1) */
mpz_mul_ui (f, f, n+1); /* (n+1)! = n! * (n+1) */
}
n = 2097169; /* a prime = 1 mod 4*/
if (n / 2 > MP_LIMB_T_MAX)
n = 131041; /* a smaller prime :-) */
mpz_fac_ui (f, n / 2); /* ((n-1)/2)! */
m = mpz_fdiv_ui (f, n); /* ((n-1)/2)! mod n*/
mpz_set_ui (f, m);
mpz_mul_ui (f, f, m); /* (((n-1)/2)!)^2 */
m = mpz_fdiv_ui (f, n); /* (((n-1)/2)!)^2 mod n*/
if ( m != n - 1)
{
printf ("mpz_fac_ui(%lu) wrong\n", n / 2);
printf (" al-Haytham's theorem not verified: got %lu, expected %lu.\n", m, n - 1);
abort ();
}
mpz_clear (df[0]);
mpz_clear (df[1]);
mpz_clear (f);
mpz_clear (r);
tests_end ();
exit (0);
}
|
