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

1 vote123 views1 answer
Jupyter notebook how to set max display row columns matrix numpy
Python
0 vote122 views2 answers
How to send one variable to python using xlwings
Python
19 votes121 views4 answers
Python save figure
Python
0 vote142 views1 answer
Python x,y,z is d (20, 30, False)
Python
-2 votes109 views1 answer
Jwt authentication python flask
Python
0 vote115 views1 answer
400/15
Python
0 vote120 views1 answer
Old Handler API is deprecated - see https://git.io/fxJuV for details
Python
0 vote116 views1 answer
How to print a matrix in python
Python
13 votes115 views1 answer
Selenium getting started
Python
0 vote136 views1 answer
Fibonacci logic in pthon in for loop
Python