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

6 votes116 views5 answers
Python open folder in explorer
Python
0 vote143 views1 answer
Read ms word with python
Python
0 vote133 views1 answer
Python GUI kivvy
Python
0 vote122 views1 answer
Python namedtuple typename
Python
0 vote148 views1 answer
How to install a python packagae
Python
0 vote110 views1 answer
13 digit timestamp python
Python
1 vote146 views1 answer
Filter foreign fileds django_filters
Python Django
0 vote77 views1 answer
Snipe cmd python.py
Python
0 vote124 views1 answer
Optimize images in python using pillow
Python
0 vote139 views1 answer
Celery timezone setting django
Python Django