A Simple Algorithm for Prime Factorization and Primality Testing by Kabenge Hamiss

“…This algorithm is very fast especially when the difference in the prime components of a composite number (prime gap) is not so large. When the difference between the factors (prime gap) is not so large, it often requires just a single iteration to obtain the factors.…”
Get full text