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 vote343 views1 answer
Alternatives for appending to numpy array
Python
1 vote315 views1 answer
Import open3d Illegal instruction (core dumped)
Python
-2 votes336 views4 answers
Django datepicker
Python Django
0 vote309 views1 answer
Off to obj python
Python
0 vote294 views1 answer
Copy dataframe columns names
Python
28 votes295 views2 answers
Making your own range function with step in python
Python
1 vote337 views1 answer
Torch save state dict
Python
6 votes318 views5 answers
Docstrings in python
Python
0 vote323 views3 answers
How to draw dendrogram in python
Python
0 vote320 views2 answers
Convert numpy array to HSV cv
Python