Development of
Algorithmic Constructions


Helmes p-1 Factorization in the complex field

This is a factorization algorithm similar to Pollard p-1 factorization,
but it is faster, because there is no use of a gcd in every loop.
The algorithm has the same limits as the Pollard p-1 algorithm.

You can combine it with the Helmes p+1 algorithm in the adjoined field.

Implementation in Mupad

20000900009, "=", 100003, "*", 200003