Changeset 4a210b3 in git

Timestamp:

Dec 22, 2006, 1:06:28 PM (17 years ago)

Author:

Gerhard Pfister <pfister@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

6881a3917411ce8ae2352b62f115cbf182a7d528

Parents:

d1075e8def9e2f28ec26749e3f7a5fead8834f4d

Message:

output von pFactor geaendert


git-svn-id: file:///usr/local/Singular/svn/trunk@9615 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/LIB/krypto.lib (modified) (3 diffs)

Singular/LIB/krypto.lib

@@ -1 +1 @@
 //GP, last modified 28.6.06
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: krypto.lib,v 1.4 2006-12-14 10:49:05 pfister Exp $";
+version="$Id: krypto.lib,v 1.5 2006-12-22 12:06:28 pfister Exp $";
 category="Teaching";
 info="
@@ -930 +930 @@
 proc pFactor(number n,int B, list P)
 "USAGE:  pFactor(n,B.P); n to be factorized, B a bound , P a list of primes
-RETURN: a list of factors of n or the message: no factor found
+RETURN: a list of factors of n or n if no factor found
 NOTE: Pollard's p-factorization
        creates the product k of powers of primes (bounded by B)  from
@@ -955 +955 @@
    number d=gcdN(powerN(a,k,n)-1,n);
    if((d>1)&&(d<n)){return(d);}
-   return("no factor found");
+   return(n);
 }
 example