Home
last modified time | relevance | path

Searched refs:bmodp (Results 1 – 6 of 6) sorted by relevance

/dports/math/singular/Singular-Release-4-2-1/factory/
H A Dfac_util.cc186 CanonicalForm amodp, bmodp, smodp, tmodp, s, t, sigma, tau, e; in extgcd() local
191 amodp = mapinto( a ); bmodp = mapinto( b ); in extgcd()
192 (void)extgcd( amodp, bmodp, smodp, tmodp ); in extgcd()
204 divrem( sigmat, bmodp, q, sigma ); in extgcd()
/dports/math/p5-Math-Prime-Util-GMP/Math-Prime-Util-GMP-0.52/
H A Dtinyqs.c1260 s32 bmodp = prime - mpz_tdiv_ui(b, prime); in find_first_poly_b() local
1277 fbptr->roots[0] = amodp * modinv_16(2 * bmodp % prime, prime) % prime; in find_first_poly_b()
1287 fbptr->roots[0] = amodp * (bmodp + modsqrt) % prime; in find_first_poly_b()
1288 fbptr->roots[1] = amodp * (bmodp + prime - modsqrt) % prime; in find_first_poly_b()
1291 bmodp = mpz_tdiv_ui(params->poly_b_aux[j], prime); in find_first_poly_b()
1292 params->root_aux[j * fb_size + i] = bmodp * amodp % prime; in find_first_poly_b()
1391 s32 bmodp = mpz_tdiv_ui(b, prime); in find_next_poly_b() local
1393 bmodp = prime - bmodp; in find_next_poly_b()
1394 fbptr->roots[0] = cmodp * modinv_16(2 * bmodp % prime, prime) % prime; in find_next_poly_b()
/dports/math/giacxcas/giac-1.6.0/src/
H A Difactor.cc1606 int q,bmodp=p-modulo(*b._ZINTptr,p); in switch_roots() local
1608 q=(M+longlong(cmodp)*invmodnoerr((2*bmodp)%p,p))%p; in switch_roots()
1678 int q,bmodp=p-modulo(*b._ZINTptr,p); in switch_roots() local
1680 q=(M+longlong(cmodp)*invmodnoerr((2*bmodp)%p,p))%p; in switch_roots()
1780 int bmodp=p-modulo(*b._ZINTptr,p); in init_roots() local
1785 basisptr->root1=(M+(bmodp+sqrtm)*inva) % p; in init_roots()
1786 basisptr->root2=(M+(bmodp+p-sqrtm)*inva) % p; in init_roots()
1791 addmultmod(q,bmodp+sqrtm,inva,p); in init_roots()
1794 addmultmod(q,bmodp+p-sqrtm,inva,p); in init_roots()
1797 basisptr->root1=(M+longlong(bmodp+sqrtm)*inva) % p; in init_roots()
[all …]
/dports/math/form/form-4.2.1/sources/
H A Dpolyfact.cc188 poly bmodp(b,a.modp,1); in extended_gcd_Euclidean_lifted() local
196 poly dsa((samodp * errormodp) % bmodp); in extended_gcd_Euclidean_lifted()
199 poly dsb((errormodp - dsa*amodp) / bmodp); in extended_gcd_Euclidean_lifted()
H A Dpolywrap.cc1699 poly bmodp(b,modp,1); in poly_inverse() local
1702 vector<poly> xgcd(polyfact::extended_gcd_Euclidean_lifted(amodp,bmodp)); in poly_inverse()
1706 if (!((invamodp * amodp) % bmodp).is_one()) { in poly_inverse()
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/sieve/ecm/
H A Dmpqs_doit.c278 findroot (unsigned long *k2, unsigned long bmodp, unsigned long p, in findroot() argument
289 modul_set_ul_reduced (bb, bmodp, pp); in findroot()