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

4 votes240 views1 answer
Get os information python
Python
-1 vote196 views1 answer
Expected ")" pylance python
Python
3 votes232 views3 answers
Python check if variable has value
Python
0 vote254 views1 answer
Python math inf
Python
0 vote230 views1 answer
Convert ipynb to py
Python
0 vote283 views1 answer
Python send commands in one line but write in multiple
Python
82 votes268 views4 answers
Python read json file array
Python
0 vote259 views1 answer
Pygame pin to top
Python
0 vote249 views1 answer
Pandas filter length of string
Python
1 vote237 views2 answers
Update to python 3.7
Python