Changeset 8e48d49 in git for Singular/LIB/crypto.lib

Timestamp:

Apr 8, 2013, 5:18:22 PM (11 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

b8f8ea1509ff92e49428ea7c5713993cd700fbb6

Parents:

cb8103ab4516946ba32e6fe69dc8bf83954ec2c9

git-author:

Hans Schoenemann <hannes@mathematik.uni-kl.de>2013-04-08 17:18:22+02:00

git-committer:

Hans Schoenemann <hannes@mathematik.uni-kl.de>2013-04-08 17:19:32+02:00

Message:

fix: typo in doc.

File:

• Singular/LIB/crypto.lib (modified) (1 diff)

Singular/LIB/crypto.lib

@@ -957 +957 @@
 //======================== Pollards p-factorization ================
 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
+"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 n if no factor found
 NOTE: Pollard's p-factorization
        creates the product k of powers of primes (bounded by B)  from
        the list P with the idea that for a prime divisor p of n we have
-       p-1|k, and then p devides gcd(a^k-1,n) for some random a
+       p-1|k, and then p divides gcd(a^k-1,n) for some random a
 EXAMPLE:example pFactor; shows an example
 "