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 vote321 views1 answer
Sin , Cos Graph using python turtle.
Python
0 vote333 views1 answer
Start virtualenv with python version
Python
1 vote344 views1 answer
Difference of two set in python
Python
30 votes333 views1 answer
Python generate folder if it not exist
Python
1 vote326 views1 answer
Django login redirect
Python
28 votes334 views3 answers
Round down a number python
Python
0 vote292 views1 answer
Add date and time of today in python
Python
0 vote319 views1 answer
Automl classification tutorial sklearn
Python
4 votes347 views1 answer
How to make a custom icon for pygame
Python
0 vote372 views1 answer
Mod trong python
Python