معرفی شرکت ها
fasterprimes-0.0.4
تبلیغات ما
مشتریان به طور فزاینده ای آنلاین هستند. تبلیغات می تواند به آنها کمک کند تا کسب و کار شما را پیدا کنند.
مشاهده بیشتر
تبلیغات ما
مشتریان به طور فزاینده ای آنلاین هستند. تبلیغات می تواند به آنها کمک کند تا کسب و کار شما را پیدا کنند.
مشاهده بیشتر
تبلیغات ما
مشتریان به طور فزاینده ای آنلاین هستند. تبلیغات می تواند به آنها کمک کند تا کسب و کار شما را پیدا کنند.
مشاهده بیشتر
تبلیغات ما
مشتریان به طور فزاینده ای آنلاین هستند. تبلیغات می تواند به آنها کمک کند تا کسب و کار شما را پیدا کنند.
مشاهده بیشتر
تبلیغات ما
مشتریان به طور فزاینده ای آنلاین هستند. تبلیغات می تواند به آنها کمک کند تا کسب و کار شما را پیدا کنند.
مشاهده بیشترتوضیحات
Fastest Prime Number Calculation (checks) logic for python. Also contains other prime number calculation ways
| ویژگی | مقدار |
|---|---|
| سیستم عامل | - |
| نام فایل | fasterprimes-0.0.4 |
| نام | fasterprimes |
| نسخه کتابخانه | 0.0.4 |
| نگهدارنده | [] |
| ایمیل نگهدارنده | [] |
| نویسنده | Ganesh Bhat |
| ایمیل نویسنده | Ganesh Bhat <ganeshsurfs@gmail.com> |
| آدرس صفحه اصلی | https://github.com/ganeshkbhat/fastprimecalculations/tree/main/python |
| آدرس اینترنتی | https://pypi.org/project/fasterprimes/ |
| مجوز | - |
# 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 fast-prime`.
- Deprecating dash (-) separated package names but keeping updated `pip install fast-prime` and `pip install fast-prime-numbers`
- Access Python code using `from fasterprimes import *`
<!-- fast-prime-numbers -->
<!-- fast-primes -->
<!-- fasterprimes -->
```
# # Usage API for python
# pip install fasterprimes
# pip install fast-prime
# pip install fast-prime-numbers
from fasterprimes import *
fast(13)
conventional(13)
sqroot(13)
aks(13)
```
Stack overflow Link for Calculations
- [Javascript Codebase](https://stackoverflow.com/questions/40200089/number-prime-test-in-javascript/71437628?noredirect=1#comment126271353_71437628)
- [Python Codebase](https://stackoverflow.com/questions/1801391/how-to-create-the-most-compact-mapping-n-%e2%86%92-isprimen-up-to-a-limit-n/71438297#71438297)
### LICENSE
[`PROPRIETARY LICENSE AGREEMENT ONLY`](https://github.com/ganeshkbhat/fastprimecalculations/blob/main/LICENSE)
زبان مورد نیاز
| مقدار | نام |
|---|---|
| >=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*, <4 | Python |
نحوه نصب
نصب پکیج whl fasterprimes-0.0.4:
pip install fasterprimes-0.0.4.whl
نصب پکیج tar.gz fasterprimes-0.0.4:
pip install fasterprimes-0.0.4.tar.gz