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

14 votes132 views2 answers
Fastapi authentication
Python
44 votes137 views3 answers
How can I sort a dictionary in python according to its values?
Python
0 vote135 views1 answer
Pyplot width
Python
1 vote125 views1 answer
Difference of two set in python
Python
0 vote158 views2 answers
Flask return html
Python
0 vote130 views1 answer
Qtile: latest development version
Python
16 votes134 views6 answers
Python print statement
Python
18 votes142 views6 answers
Get ip python
Python
7 votes131 views3 answers
Pandas convert date to string
Python
8 votes137 views4 answers
Create an array with same value python
Python