Metadata-Version: 2.4
Name: prime-number-calculator
Version: 0.1.0
Summary: A python module that aims to fleetly determine whether a small positive integer is a prime number.
Keywords: prime-number,prime-number-calculations,prime-factorization
Author-email: Hermetia-illucens <249956748+Hermetia-illucens@users.noreply.github.com>
Requires-Python: >=3.7
Description-Content-Type: text/markdown
License-File: LICENSE
Project-URL: GitHub, https://github.com/Hermetia-illucens/Prime-number-calculator

# Prime number calculator

## Installation
```bash
pip install prime-number-calculator
```

## Examples
```python
number=int(input())

from prime_number import prime_number
print(prime_number(number))

from prime_number import submultiple
print(submultiple(number))

from prime_number import prime_factorization
print(prime_factorization(number))
```

## Introduction
This algorithm is much faster for positive integers less than 10<sup>16</sup> comparing with the classical ones such as: 
```python
def isPrime(N):
    if N%2==0 and N-2:
        return False
    else:
        for n in range(3,int(N**0.5)+1,2):
            if N%n==0:
                return False
        return True
```

