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 vote376 views1 answer
Check if digit or alphabet
Python
3 votes353 views1 answer
How to read a .exe file in python
Python
1 vote294 views1 answer
Plus months onto python date
Python
0 vote335 views2 answers
Feature selection python
Python
0 vote365 views2 answers
OLE DB
Python
265 votes520 views27 answers
Rename column pandas
Python
1 vote361 views1 answer
How to get maximum value of number in python
Python
1 vote364 views1 answer
Passing Functions Around python
Python
0 vote360 views1 answer
Python placeholder
Python
2 votes291 views2 answers
How to play audio in python
Python