data_structures.hashing.number_theory.prime_numbers

module to operations with prime numbers

Functions

is_prime(→ bool)	Checks to see if a number is a prime in O(sqrt(n)).
next_prime(value[, factor])

Module Contents

data_structures.hashing.number_theory.prime_numbers.is_prime(number: int) → bool

Checks to see if a number is a prime in O(sqrt(n)).

A number is prime if it has exactly two factors: 1 and itself.

>>> is_prime(0)
False
>>> is_prime(1)
False
>>> is_prime(2)
True
>>> is_prime(3)
True
>>> is_prime(27)
False
>>> is_prime(87)
False
>>> is_prime(563)
True
>>> is_prime(2999)
True
>>> is_prime(67483)
False

data_structures.hashing.number_theory.prime_numbers.next_prime(value, factor=1, **kwargs)