38 const size_t CAP = 4000;
39 mp_ptr expect = alloc_limbs(CAP);
46 mp_ptr dst = alloc_limbs(need + 2);
56 mp_ptr dst = alloc_limbs(need + 2);
68 const u32 n_values[] = {0, 1, 2, 5, 10, 20, 50, 100, 200, 1000, 10000};
69 for (
size_t n_index = 0; n_index <
ARRAY_SIZE(n_values); ++n_index) {
70 u32 n = n_values[n_index];
73 mp_ptr dst = alloc_limbs(need + 2);
82 for (
u32 i = built + 1; i <=
n; ++i) elen = chain_mul_small(expect, elen, i, CAP);
87 for (
int pi = 0; pi < MOD_P_CNT; ++pi) {
90 for (
u32 i = 2; i <=
n; ++i) m = mulmod32(m, i % p, p);
102 mp_ptr dst = alloc_limbs(need + 2);
106 for (
int pi = 0; pi < MOD_P_CNT; ++pi) {
109 for (
u32 i = 2; i <=
n; ++i) m = mulmod32(m, i % p, p);
117TEST_CASE(
"numth/fac_extern", double_hyper_super_primefac) {
120 struct known_result {
u32 n;
u64 v; } known[] = {{0, 1ull}, {1, 1ull}, {9, 945ull}, {10, 3840ull}};
121 for (
size_t k_index = 0; k_index <
ARRAY_SIZE(known); ++k_index) {
122 const struct known_result
k = known[k_index];
125 mp_ptr dst = alloc_limbs(need + 2);
133 const size_t CAP = 512;
134 mp_ptr e = alloc_limbs(CAP);
135 const u32 n_values[] = {2, 3, 10, 21, 50, 107, 301};
136 for (
size_t n_index = 0; n_index <
ARRAY_SIZE(n_values); ++n_index) {
137 u32 n = n_values[n_index];
141 for (
u32 i = (
n % 2 == 0 ? 2 : 1); i <=
n; i += 2)
142 elen = chain_mul_small(e, elen, i, CAP);
145 mp_ptr dst = alloc_limbs(need + 2);
154 const size_t CAP2 = 4096;
155 mp_ptr h = alloc_limbs(CAP2),
t = alloc_limbs(CAP2);
159 for (
u32 k = 1;
k <= 20; ++
k) {
163 for (
u32 i = 0; i <
k; ++i) tn = chain_mul_small(
t, tn,
k, CAP2);
165 mul_sorted(
prod, h, hlen,
t, tn);
166 hlen = norm_len(
prod, hlen + tn);
167 memcpy(h,
prod, (
size_t)hlen * 8);
169 if (
k == 1 ||
k == 3 ||
k == 5 ||
k == 8 ||
k == 20) {
172 mp_ptr dst = alloc_limbs(need + 2);
185 const size_t CAP3 = 4096;
189 for (
u32 k = 1;
k <= 30; ++
k) {
192 mp_ptr fac = alloc_limbs(need + 2);
195 mp_size_t flen = norm_len(fac, need + 2);
198 mul_sorted(
prod,
s, slen, fac, flen);
199 slen = norm_len(
prod, slen + flen);
200 memcpy(
s,
prod, (
size_t)slen * 8);
202 if (
k == 1 ||
k == 3 ||
k == 5 ||
k == 8 ||
k == 30) {
204 mp_ptr dst = alloc_limbs(need + 2);
216 const size_t CAP4 = 4096;
217 mp_ptr pf = alloc_limbs(CAP4);
218 const u32 n_values2[] = {2, 3, 10, 20, 50, 700};
219 for (
size_t n_index = 0; n_index <
ARRAY_SIZE(n_values2); ++n_index) {
220 u32 n = n_values2[n_index];
223 for (
u32 p = 2; p <=
n; ++p)
224 if (is_prime_small(p)) plen = chain_mul_small(pf, plen, p, CAP4);
226 mp_ptr dst = alloc_limbs(need + 2);
237 const u64 dp_values[] = {2, 3, 5, 7};
238 for (
size_t dp_index = 0; dp_index <
ARRAY_SIZE(dp_values); ++dp_index) {
239 u64 dp = dp_values[dp_index];
240 mp_ptr np = alloc_limbs(3), d = alloc_limbs(1);
242 for (
int k = 0;
k < 4; ++
k) {
247 for (
int i = 0; i <
k; ++i) nn = chain_mul_small(np, nn, dp, 3);
248 nn = chain_mul_small(np, nn, 11, 3);
mp_size_t lmmp_remove_(mp_ptr np, mp_size_t *nn, mp_srcptr dp, mp_size_t dn)
除去 [np,nn] 中的 [dp,dn] 的因子