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

40 votes283 views6 answers
Pandas reset index
Python
0 vote333 views1 answer
How to return an html file in flask
Python Flask
0 vote277 views1 answer
Firestore search query flutter
Python
5 votes283 views2 answers
Filter dataframe with list
Python
2 votes259 views2 answers
Del all variables python
Python
1 vote282 views1 answer
Tkinter center frame
Python
0 vote281 views1 answer
Pong code python
Python
0 vote297 views1 answer
Python apply function to dictionary values
Python
0 vote259 views1 answer
Np.linalg.eigvals positive check python
Python
3 votes264 views2 answers
How to create a network scanner in python
Python