Searched refs:the_bad_primes (Results 1 – 6 of 6) sorted by relevance
146 if(discr_factored) the_bad_primes=c.the_bad_primes; in Curvedata()155 if(discr_factored) the_bad_primes=c.the_bad_primes; in Curvedata()198 if(discr_factored) the_bad_primes = c.the_bad_primes; in operator =()228 vector<bigint>::iterator pr = the_bad_primes.begin(); in minimalize()229 while(pr!=the_bad_primes.end()) in minimalize()234 the_bad_primes=new_bad_primes; in minimalize()238 the_bad_primes = pdivs(discr); in minimalize()311 os << "bad primes: " << the_bad_primes << ";\t"; in output()
406 pi=C.the_bad_primes.begin(); in dumpdata()407 while(pi!=C.the_bad_primes.end()) os << C.reduct_array[*pi++].ord_p_discr << sep; in dumpdata()408 pi=C.the_bad_primes.begin(); in dumpdata()409 while(pi!=C.the_bad_primes.end()) os << C.reduct_array[*pi++].ord_p_j_denom << sep; in dumpdata()410 pi=C.the_bad_primes.begin(); in dumpdata()411 while(pi!=C.the_bad_primes.end()) os << C.reduct_array[*pi++].c_p << sep; in dumpdata()412 pi=C.the_bad_primes.begin(); in dumpdata()413 while(pi!=C.the_bad_primes.end()) os << C.reduct_array[*pi++].Kcode.code << sep; in dumpdata()
114 the_bad_primes=E.the_bad_primes; in operator =()139 vector<bigint>::const_iterator pi= the_bad_primes.begin(); in CurveRed()140 while(pi!=the_bad_primes.end()) in CurveRed()
132 return HasGoodReduction(P,the_bad_primes,p0); in HasGoodReduction()591 vector<bigint> plist = the_bad_primes; in egr_subgroup()
134 {if(!discr_factored){ the_bad_primes=pdivs(discr); discr_factored=1; }} in factor_discr()158 return c.the_bad_primes; in getbad_primes()170 vector<bigint> the_bad_primes; //prime divisors of discriminant variable283 {return c.the_bad_primes; } in getbad_primes()
86 int grprimes(vector<Point>& Plist) {return grprimes(Plist,the_bad_primes);} in grprimes()