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

2 votes296 views1 answer
Django get current date
Python
2 votes254 views2 answers
What is role of ALLOWED_HOSTs in Django
Python Django
0 vote266 views1 answer
Python get time executed by function
Python
0 vote316 views2 answers
Types of methods in oop python
Python
0 vote279 views1 answer
Tuple plot python
Python
6 votes298 views2 answers
Python list distinct
Python
26 votes255 views1 answer
Dict from two lists
Python
-1 vote288 views2 answers
Rename folder python
Python
0 vote240 views1 answer
Selenium save webpage as pdf python
Python
0 vote248 views1 answer
Python get next item from generator
Python