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

14 votes298 views2 answers
Python check if dictionary empty
Python
0 vote315 views1 answer
Django auto increment field
Python Django
0 vote302 views1 answer
How to work with django ornm __in
Python
0 vote284 views1 answer
Python for loop float increment
Python
0 vote291 views1 answer
Change form type flask from text to selection flask admin
Python
1 vote282 views1 answer
How does urllib.parse.urlsplit work in python
Python
-2 votes212 views1 answer
Python google oauth2 example
Python
0 vote291 views1 answer
Sum values
Python
-1 vote300 views1 answer
Python type checking boolean
Python
0 vote267 views1 answer
Str = "This article is written in {}" print (str.format("Python"))
Python