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

2 votes165 views2 answers
Empty directory if not empty python
Python
39 votes189 views2 answers
String to list of characters python
Python
20 votes173 views3 answers
Python download image
Python
1 vote166 views1 answer
Get number of key in dictionary python
Python
0 vote177 views1 answer
Call a function with prameters inm tkinter buttion
Python
1 vote156 views1 answer
Reject invalid input using a loop in python
Python
0 vote182 views1 answer
Crawling emails with python
Python
0 vote229 views1 answer
Get feature names from one hot encoder
Python
0 vote159 views2 answers
Tkinter progresse bar color
Python
1 vote158 views1 answer
Pytest --clrear cache
Python