Prime number checking algorithm

def is_prime(n: int) -> bool:
    """Primality test using 6k+-1 optimization."""
    if n <= 3:
        return n > 1
    if n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i ** 2 <= n:
        if n % i == 0 or n % (i + 2) == 0:
            return False
        i += 6
    return True

Source: en.wikipedia.org

Similar codes

0 vote226 views1 answer
Ornhgvshy vf orggre guna htyl
Python
1 vote218 views1 answer
Code to calculate dice score
Python
51 votes235 views5 answers
Mr robot
Python
0 vote227 views1 answer
Get unique words from pandas dataframe
Python
5 votes216 views2 answers
Isnotin python
Python
8 votes243 views2 answers
Django create empty migration
Python Django
1 vote216 views1 answer
Downgrade pip
Python
8 votes224 views5 answers
What is module in python
Python
0 vote228 views1 answer
Connect mysql sql alchemy
Python
0 vote208 views1 answer
Python cast number to between 0 and 1
Python