Previous Page Next Page Contents

numlib::pollard -- Pollard's rho factorization algorithm

Introduction

numlib::pollard(n, m) tries to find a factor of n using m iterations of Pollard's rho algorithm.

If m is missing, 10000 iterations are carried out.

Call(s)

numlib::pollard(n, <m>)

Parameters

n,m - positive integers

Returns

numlib::pollard returns n, a sequence of two factors, or FAIL.

Related Functions

ifactor, numlib::ecm, numlib::mpqs

Details

Example 1

>> numlib::pollard(10000000019)
                                10000000019
>> numlib::pollard(278218430085289734806642953)
                                   FAIL
>> numlib::pollard(278218430085289734806642953,10^5)
                       3486784409, 79792266297612017

Changes




Do you have questions or comments?


Copyright © SciFace Software GmbH & Co. KG 2000