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

28 votes175 views2 answers
Python string slicing
Python
4 votes217 views6 answers
Python cheat sheet
Python
0 vote221 views1 answer
How to use put method in django
Python Django
3 votes171 views2 answers
Adjust tick label size matplotlib
Python
1 vote167 views2 answers
Python for looop array value and index
Python
0 vote170 views1 answer
How to send jobs to queue dynamically
Python
3 votes211 views4 answers
Generate fibonacci series in python
Python
110 votes165 views6 answers
Read text file in python
Python
0 vote251 views1 answer
Django model custom field
Python Django
4 votes188 views1 answer
Any python
Python