Prime number calculator

Installation

pip install prime-number-calculator

Examples

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¹⁶ comparing with the classical ones such as:

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