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 votes187 views2 answers
Add y axis label matplotlib
Python
6 votes187 views2 answers
How to make an infinite loop python
Python
41 votes189 views6 answers
Python print new line
Python
0 vote208 views1 answer
Pyelastic search get document
Python
0 vote179 views1 answer
Matplotlib show two distinct plots
Python
0 vote192 views1 answer
Import nifti to numpy
Python
0 vote196 views1 answer
Name 'Pipeline' is not defined
Python
0 vote202 views3 answers
Waitress
Python
30 votes400 views6 answers
How to create a superuser in django
Python Django
0 vote191 views1 answer
Python module to get football results
Python