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
119
120
121
122
123
124
125
126
127
128
129
|
/* mpz_mfac_uiui(RESULT, N, M) -- Set RESULT to N!^(M) = N(N-M)(N-2M)...
Contributed to the GNU project by Marco Bodrato.
Copyright 2012, 2013 Free Software Foundation, Inc.
This file is part of the GNU MP Library.
The GNU MP Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser 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 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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MP Library. If not, see https://www.gnu.org/licenses/. */
#include "gmp.h"
#include "gmp-impl.h"
/*************************************************************/
/* Section macros: common macros, for swing/fac/bin (&sieve) */
/*************************************************************/
#define FACTOR_LIST_STORE(P, PR, MAX_PR, VEC, I) \
do { \
if ((PR) > (MAX_PR)) { \
(VEC)[(I)++] = (PR); \
(PR) = (P); \
} else \
(PR) *= (P); \
} while (0)
/*********************************************************/
/* Section oder factorials: */
/*********************************************************/
/* mpz_mfac_uiui (x, n, m) computes x = n!^(m) = n*(n-m)*(n-2m)*... */
void
mpz_mfac_uiui (mpz_ptr x, unsigned long n, unsigned long m)
{
ASSERT (n <= GMP_NUMB_MAX);
ASSERT (m != 0);
if ((n < 3) | (n - 3 < m - 1)) { /* (n < 3 || n - 1 <= m || m == 0) */
PTR (x)[0] = n + (n == 0);
SIZ (x) = 1;
} else { /* m < n - 1 < GMP_NUMB_MAX */
mp_limb_t g, sn;
mpz_t t;
sn = n;
g = mpn_gcd_1 (&sn, 1, m);
if (g > 1) { n/=g; m/=g; }
if (m <= 2) { /* fac or 2fac */
if (m == 1) {
if (g > 2) {
mpz_init (t);
mpz_fac_ui (t, n);
sn = n;
} else {
if (g == 2)
mpz_2fac_ui (x, n << 1);
else
mpz_fac_ui (x, n);
return;
}
} else { /* m == 2 */
if (g > 1) {
mpz_init (t);
mpz_2fac_ui (t, n);
sn = n / 2 + 1;
} else {
mpz_2fac_ui (x, n);
return;
}
}
} else { /* m >= 3, gcd(n,m) = 1 */
mp_limb_t *factors;
mp_limb_t prod, max_prod, j;
TMP_DECL;
sn = n / m + 1;
j = 0;
prod = n;
n -= m;
max_prod = GMP_NUMB_MAX / n;
if (g > 1)
factors = MPZ_NEWALLOC (x, sn / log_n_max (n) + 2);
else {
TMP_MARK;
factors = TMP_ALLOC_LIMBS (sn / log_n_max (n) + 2);
}
for (; n > m; n -= m)
FACTOR_LIST_STORE (n, prod, max_prod, factors, j);
factors[j++] = n;
factors[j++] = prod;
if (g > 1) {
mpz_init (t);
mpz_prodlimbs (t, factors, j);
} else {
mpz_prodlimbs (x, factors, j);
TMP_FREE;
return;
}
}
{
mpz_t p;
mpz_init (p);
mpz_ui_pow_ui (p, g, sn); /* g^sn */
mpz_mul (x, p, t);
mpz_clear (p);
mpz_clear (t);
}
}
}
|
