Changeset 2ae57f in git
 Timestamp:
 Jun 27, 2011, 2:49:19 PM (12 years ago)
 Branches:
 (u'jengelhdatetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
 Children:
 4986481fc1e216c927221c4ebffb8cf0cdbe2a77
 Parents:
 f0767093994fab690dbf3086af5fafdae097638d
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/primdecint.lib
rf076709 r2ae57f 25 25 "; 26 26 27 LIB " crypto.lib";27 LIB "primdec.lib"; 28 28 29 29 //////////////////////////////////////////////////////////////////////////////// … … 407 407 number q=imap(R,q); 408 408 //=== computes the primes occuring in a generator of I intersect Z 409 list L=PollardRho(q,5000,1); 409 //list L=PollardRho(q,5000,1); 410 list L=primefactors(q)[1]; 410 411 for(i=1;i<=size(L);i++) 411 412 { … … 545 546 number q=imap(R,q); 546 547 //=== computes the primes occuring in a generator of I intersect Z 547 list L=PollardRho(q,5000,1); 548 //list L=PollardRho(q,5000,1); 549 list L=primefactors(q)[1]; 548 550 for(i=1;i<=size(L);i++) 549 551 { … … 636 638 number q=imap(R,q); 637 639 //=== computes the primes occuring in a generator of I intersect Z 638 list L=PollardRho(q,5000,1); 640 //list L=PollardRho(q,5000,1); 641 list L=primefactors(q)[1]; 639 642 for(i=1;i<=size(L);i++) 640 643 { … … 743 746 number s; 744 747 //=== computes the primes occuring in a generator of I intersect Z 745 list L=PollardRho(q,5000,1); 748 //list L=PollardRho(q,5000,1); 749 list L=primefactors(q)[1]; 746 750 list Le; 747 751 for(i=1;i<=size(L);i++) … … 972 976 ring Rhelp=0,x,dp; 973 977 number h=imap(R,h); 974 list L=PollardRho(h,5000,1); 978 //list L=PollardRho(h,5000,1); 979 list L=primefactors(h)[1]; 975 980 for(i=1;i<=size(L);i++){L[i]=int(L[i]);} 976 981 setring R;
Note: See TracChangeset
for help on using the changeset viewer.