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 vote136 views1 answer
2 - 20 python
Python
1 vote106 views2 answers
Cool python imports
Python
0 vote139 views1 answer
Frogenset ito list pandas
Python
1 vote110 views1 answer
Sparse arrays hackerrank solution in python
Python
0 vote132 views1 answer
Divide by zero error python exception handling
Python
6 votes106 views1 answer
How to print a float with only 2 digits after decimal in python
Python
0 vote94 views1 answer
Torch.tensor.expand
Python
2 votes96 views1 answer
Python merge strings in columns
Python
0 vote107 views1 answer
Python print ling line in print
Python
0 vote109 views1 answer
How to solve add decimals in strings as integers
Python