A faster way to find if a number is prime
Project description
This is a library to find if a number is prime. It takes O(n^1/2) time complexity as compared to O(n) in common method
Change Log
0.0.1 (23/01/2023)
First Release
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
pcprimefinder-0.0.1.tar.gz
(4.0 MB
view hashes)