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 vote146 views1 answer
Python create local list
Python
133 votes139 views6 answers
Python read json
Python
0 vote185 views1 answer
Django model registration
Python Django
1 vote98 views1 answer
How to draw line in markdown
Python
0 vote154 views3 answers
Boxplot pandas
Python
0 vote146 views2 answers
Get the first item from an iterable that matches a condition
Python
3 votes200 views5 answers
Euclid algorithm
Python
1 vote141 views1 answer
Python seconds counter
Python
0 vote155 views1 answer
Importare un foglio di un file excel in python
Python
0 vote136 views1 answer
Python Bz2 install
Python