Fastest Prime Number Calculation (checks) logic for python. Also contains other prime number calculation ways
Project description
Fast Prime Calculations
Fastest Prime Number Calculation (checks) logic and This probably is the BEST solution in the internet as of today 11th March 2022
This same code can be applied in any languages like Python
, Go
Lang, Java
, PHP
, Node.js
, Javascript
, C
, C++
, .NET
, Rust
, etc with the same logic and have performance benefits. It is pretty fast based on the number of iterations needed. Performance time checks were not consistent across languages (in my local system  to be direct about wordings). I have not seen this implemented before and has been indigenously done. Feedback and usage is welcome.
Max iterations 16666 for n == 100000 instead of 100000 of conventional way
. The iterations
counts for different ways for Prime number check 100007 can be seen as follows:
count: Prime Conventional way for 83 is 81
Is Prime 83 isPrimeConventionalWay: True
count: Prime Squareroot way 83 is 8
Is Prime 83 isPrimeSquarerootWay: True
count: Prime Unconventional way for 83 is 14
Is Prime 83 prime (SUGGESTED): True
count: Prime AKS  Mersenne primes  Fermat's little theorem or whatever way 83 is 2
Is Prime 83 isprimeAKSWay: True
count: Prime Conventional way for 169 is 12
Is Prime 169 isPrimeConventionalWay: False
count: Prime Squareroot way 169 is 12
Is Prime 169 isPrimeSquarerootWay: False
count: Prime Unconventional way for 169 is 1
Is Prime 169 prime (SUGGESTED): False
count: Prime AKS  Mersenne primes  Fermat's little theorem or whatever way 169 is 4
Is Prime 169 isprimeAKSWay: False
count: Prime Conventional way for 100007 is 96
Is Prime 100007 isPrimeConventionalWay: False
count: Prime Squareroot way 100007 is 96
Is Prime 100007 isPrimeSquarerootWay: False
count: Prime Unconventional way for 100007 is 15
Is Prime 100007 prime (SUGGESTED): False
count: Prime AKS  Mersenne primes  Fermat's little theorem or whatever way 100007 is 32
Is Prime 100007 isprimeAKSWay: False
count: Prime Conventional way for 300530164787 is 1180
Is Prime 300530164787 isPrimeConventionalWay: False
count: Prime Squareroot way 300530164787 is 1180
Is Prime 300530164787 isPrimeSquarerootWay: False
count: Prime Unconventional way for 300530164787 is 196
Is Prime 300530164787 prime (SUGGESTED): False
count: Prime AKS  Mersenne primes  Fermat's little theorem or whatever way 300530164787 is 393
Is Prime 300530164787 isprimeAKSWay: False
Code Base
Javascript
Python
 Install Python code using `pip install fastprime`.
 Deprecating dash () separated package names but keeping updated `pip install fastprime` and `pip install fastprimenumbers`
 Access Python code using `from fasterprimes import *`
# # Usage API for python
# pip install fasterprimes
# pip install fastprime
# pip install fastprimenumbers
from fasterprimes import *
fast(13)
conventional(13)
sqroot(13)
aks(13)
Stack overflow Link for Calculations
LICENSE
Project details
Release history Release notifications  RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for fasterprimes0.0.4py3noneany.whl
Algorithm  Hash digest  

SHA256  a559da6ed47a5a95e5f70d69d4e727735673994002783863735218204aae5466 

MD5  ca705150af7e45a734d61634c5e73795 

BLAKE2b256  6515ba2c96d5475d10c7a67c176db7e2dae139c0bfed43937e8e53dc8255a46e 