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

4 votes287 views2 answers
How to make a screen in pygame
Python
0 vote316 views1 answer
How to get the time zones in python
Python
0 vote317 views1 answer
Get drive path python
Python
0 vote321 views1 answer
Fibonacci series in python using for loop
Python
32 votes330 views6 answers
Remove space from string python
Python
14 votes401 views5 answers
How to create requirements.txt django
Python Django
1 vote291 views1 answer
How to find the speed of a python program
Python
2 votes291 views3 answers
Weather today
Python
0 vote360 views1 answer
Flask put request example
Python Flask
0 vote290 views1 answer
String acharacters count in python without using len
Python