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 vote314 views1 answer
Pandas average of vectors after groupby
Python
0 vote291 views1 answer
Not staments python
Python
0 vote302 views1 answer
Concatenate dataframes using one column
Python
0 vote288 views2 answers
1000
Python
2 votes294 views1 answer
Remove n string
Python
1 vote318 views2 answers
Python get computer name
Python
0 vote334 views2 answers
Python seperate int into digit array
Python
0 vote325 views10 answers
Loop
Python
1 vote316 views2 answers
Divide a value by all values in a list
Python
2 votes291 views1 answer
Selenium python enter text
Python