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

19 votes184 views1 answer
Python left string
Python
105 votes201 views6 answers
Install opencv
Python
0 vote172 views1 answer
Atan2 of number python
Python
-1 vote203 views2 answers
Turn off grid in matplotlib 3d
Python
2 votes191 views1 answer
Django models distinct
Python
0 vote189 views2 answers
Unreadable Notebook: jpyter
Python
4 votes194 views3 answers
Python division
Python
4 votes198 views3 answers
Iterate python
Python
133 votes194 views6 answers
Python read json
Python
0 vote204 views1 answer
Open python file with read write permissions
Python