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 vote124 views1 answer
List of array to array numpy
Python
8 votes108 views1 answer
How to write a font in pygame
Python
6 votes109 views3 answers
Python split string in pairs
Python
0 vote120 views1 answer
Print treelib.Tree
Python
0 vote122 views1 answer
Newtorkx remove node
Python
0 vote114 views1 answer
Adjusted price in crsp pandas
Python
4 votes109 views2 answers
Split filename and extension python
Python
0 vote152 views1 answer
Flask minimal install
Python Flask
1 vote111 views1 answer
How to add two different times in python
Python
3 votes120 views3 answers
Use model from checkpoint tensorflow
Python