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 vote211 views1 answer
Microsoft python
Python
0 vote164 views1 answer
Frontmost flag qt
Python
33 votes178 views4 answers
Split word python
Python
0 vote179 views1 answer
No module named 'mysite'
Python
1 vote181 views1 answer
How to change web browser in python
Python
25 votes173 views4 answers
Python variable type
Python
33 votes187 views2 answers
Este año spanish meaning
Python
5 votes190 views3 answers
How to add images in hml while using flask
Python
0 vote180 views1 answer
Start ipython with any version
Python
-1 vote233 views1 answer
Django custom primary key field
Python Django