A module for finding primes.
Project description
Find Primes is a library to find all kinds of primes.
Install
pip install find-primes
A twin prime is a prime number that is either 2 less or 2 more than another prime number.
Example: Find all twin primes below 1000.
from find_primes import find_twins
print(find_twins(1000))
A palindrome prime is a prime number that is also a palindrome number.
Example: Find all palindrome primes below 1000.
from find_primes import find_palindromes
print(find_palindromes(1000))
An emirp is a prime number that results in a different prime when its decimal digits are reversed.
Example: Find all emirps below 1000.
from find_primes import find_reverse
print(find_reverse(1000))
Primes in Arithmetic Progression
Primes in arithmetic progression are any sequence of at least three prime numbers that are consecutive terms in an arithmetic progression.
Example: Find all primes in arithmetic progression below 1000.
from find_primes import find_arithmetic_prime_progressions
print(find_arithmetic_prime_progressions(1000))
A mersenne prime is a prime number that is one less than a power of two.
Example: Find all mersenne primes below 600000.
from find_primes import find_mersenne_primes
print(find_mersenne_primes(600000))
A fermat pseudoprime is a pseudoprime that satisfies fermat's little theorem.
Example: Find all fermat pseudoprimes below 1000.
from find_primes import find_fermat_pseudoprime
print(find_fermat_pseudoprime(1000))
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 find_primes-1.2.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 43ae44d5f9ad8d8ba551aa4f25e099cefe9c77cb2db1aba6127e525d5350a694 |
|
MD5 | a8a57c700fa5fc41404945e5c389986d |
|
BLAKE2b-256 | 1f6b00a457ede93bb08dc35082d16b80b0f8dcd1225ef0a55e25987e68f743f4 |