Changeset 8e48d49 in git


Ignore:
Timestamp:
Apr 8, 2013, 5:18:22 PM (9 years ago)
Author:
Hans Schoenemann <hannes@…>
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '48f1dd268d0ff74ef2f7dccbf02545425002ddcc')
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:
1 edited

Legend:

Unmodified
Added
Removed
  • Singular/LIB/crypto.lib

    rcb8103a r8e48d49  
    957957//======================== Pollards p-factorization ================
    958958proc pFactor(number n,int B, list P)
    959 "USAGE:  pFactor(n,B.P); n to be factorized, B a bound , P a list of primes
     959"USAGE:  pFactor(n,B,P); n to be factorized, B a bound , P a list of primes
    960960RETURN: a list of factors of n or n if no factor found
    961961NOTE: Pollard's p-factorization
    962962       creates the product k of powers of primes (bounded by B)  from
    963963       the list P with the idea that for a prime divisor p of n we have
    964        p-1|k, and then p devides gcd(a^k-1,n) for some random a
     964       p-1|k, and then p divides gcd(a^k-1,n) for some random a
    965965EXAMPLE:example pFactor; shows an example
    966966"
Note: See TracChangeset for help on using the changeset viewer.