Library of Python functions to work with large prime numbers with 100% accuracy.
My goal is to test an algoritm I've constructed which I expect to be faster than the factorizing method (Erathostenes). It aims to take advantage of the lower computational cost of multiplication over division, which in the domain of large numbers should be significant.
It's written in Python to take advantage of its capability of managing large numbers without limitations other than available ram.
You are free to use it but remember me on the credits!