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

10 votes260 views3 answers
Python click on screen
Python
13 votes247 views1 answer
5.4.7 categories python
Python
1 vote269 views1 answer
Python create a matrix with one in diagonal
Python
0 vote259 views1 answer
Fibonacci list pyton
Python
0 vote251 views1 answer
Roll a dice
Python
5 votes286 views3 answers
Python convert list to list of strings
Python
0 vote268 views1 answer
List loop get previous element
Python
9 votes268 views1 answer
Create models in django
Python
8 votes258 views2 answers
Python f-string padding
Python
0 vote250 views1 answer
Dataclass in python
Python