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

3 votes352 views2 answers
TypeError: 'numpy.ndarray' object is not callable
Python
0 vote320 views1 answer
Python cholesky
Python
41 votes333 views6 answers
Python comments
Python
0 vote334 views2 answers
Python call function that need args with decorator
Python
1 vote293 views1 answer
Django crispy forms foundation for site
Python Django
4 votes337 views4 answers
Distribution plot python
Python
0 vote338 views1 answer
Python opencv draw rectangle with mouse
Python
0 vote356 views1 answer
How to get scrapy output file in xml file
Python
0 vote305 views1 answer
How to get rid of an instance variable python
Python
1 vote356 views1 answer
Python multiple conditions in dataframe column values
Python