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 vote122 views1 answer
Alternatives for appending to numpy array
Python
1 vote123 views1 answer
Pandas .nlargest
Python
0 vote100 views1 answer
Find the last point of line geopanda
Python
1 vote167 views1 answer
Iterate over every alternate character in string python
Python
97 votes139 views6 answers
How to read files in python
Python
0 vote182 views1 answer
Odoo site map for employees hierarchy
Python
-1 vote119 views1 answer
Tkinter pack align left
Python
0 vote117 views2 answers
Jsonresponse status code django
Python
2 votes131 views2 answers
Array of random integers python
Python
2 votes135 views1 answer
What is modulus in python
Python