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 vote198 views1 answer
Extract x y coordinates from image in pdf python
Python
6 votes190 views2 answers
Google search api python
Python
0 vote273 views1 answer
Efficiently count zero elements in numpy array?
Python
3 votes183 views2 answers
Python writelines newline
Python
3 votes182 views1 answer
Print items in object python
Python
70 votes171 views6 answers
Pandas loop through rows
Python
1 vote179 views2 answers
Python map list of int to string
Python
-1 vote174 views1 answer
Recursive class method python
Python
0 vote184 views1 answer
Python byte like to string
Python
0 vote191 views1 answer
Weather api python
Python