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 vote204 views2 answers
Generate random string with special characters and numbers in python
Python
0 vote147 views1 answer
Lsit append in python
Python
0 vote154 views1 answer
Django Signup form
Python
0 vote139 views2 answers
A guide to numpy and pandas
Python
0 vote116 views1 answer
How to subtract up everything in a list python
Python
0 vote150 views2 answers
Html to docx python
Python
0 vote204 views1 answer
How i rwrite conditon to create 1 or 0 label from two probability column python
Python
4 votes181 views1 answer
How to address a column in a 2d array python
Python
1 vote104 views1 answer
Plus months onto python date
Python
17 votes164 views6 answers
Euclidean distance python
Python