Changeset f076709 in git
 Timestamp:
 Jun 27, 2011, 2:48:57 PM (12 years ago)
 Branches:
 (u'jengelhdatetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'f875bbaccd0831e36aaed09ff6adeb3eb45aeb94')
 Children:
 2ae57ff78cd82da1abf9ba52505c9ea78709e89c
 Parents:
 af221eadff1d9ef84261e61ccd6abdf816d19b96
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/crypto.lib
raf221ea rf076709 151 151 " 152 152 { 153 if((a mod b)==0){return(b)} 154 return(gcdN(b,a mod b)); 153 //if((a mod b)==0){return(b)} 154 //return(gcdN(b,a mod b)); 155 return(gcd(a,b)); 155 156 } 156 157 example … … 166 167 " 167 168 { 168 number d=gcdN(a,b); 169 return(a*b/d); 169 //number d=gcdN(a,b); 170 //return(a*b/d); 171 return (a*b/gcd(a,b)); 170 172 } 171 173 example … … 839 841 If allFactors is 1, it tries to find recursively all prime factors 840 842 using the SolowayStrassen test. 843 SEE ALSO: primefactors 841 844 EXAMPLE:example PollardRho; shows an example 842 845 "
Note: See TracChangeset
for help on using the changeset viewer.