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 vote239 views1 answer
Doomsday fuel foobar
Python
0 vote144 views6 answers
Assign dictionary a value from a list python
Python
4 votes191 views1 answer
Declaring a numpy array with certain size
Python
0 vote252 views1 answer
AttributeError: Can't get attribute '' on <module '__main__'> pickle
Python
0 vote241 views1 answer
Python install minio
Python
9 votes236 views2 answers
How to read video in opencv python
Python
0 vote215 views1 answer
Check if there is a certain number difference with python
Python
0 vote232 views1 answer
Open chrome in pyhton
Python
9 votes226 views6 answers
Np.random.choice
Python
0 vote215 views1 answer
Configuring tailwindcss, vue and laravel
Python