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 vote200 views1 answer
Numpy.ndarray' object has no attribute 'diff'
Python
7 votes200 views1 answer
How to get user input of list in python
Python
1 vote207 views1 answer
Seaborn plot set ylabel
Python
48 votes186 views6 answers
Python read file line by line
Python
0 vote221 views1 answer
TypeError: can't pickle weakref objects site:stackoverflow.com
Python
5 votes217 views1 answer
Purge python version ubuntu
Python
3 votes218 views1 answer
Rotate 2 dimensional list python
Python
0 vote187 views1 answer
Sys executable juypter is incorrect visual code
Python
0 vote201 views1 answer
Find the minimum item in this RDD
Python
-1 vote153 views1 answer
Instalar tkinter en python 3.10
Python