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

10 votes247 views1 answer
Create dataframe with column names pandas
Python
0 vote234 views1 answer
Python missing characters hackerrank solution
Python
4 votes214 views2 answers
How to scatter plot in matplotlib of two sets
Python
0 vote231 views1 answer
Multipart Encoder
Python
41 votes234 views6 answers
Youtube.com
Python
2 votes188 views10 answers
Python turtle tutorial
Python
4 votes227 views2 answers
Number length python
Python
0 vote227 views1 answer
Numpy distance of consecutive elements
Python
2 votes229 views5 answers
69
Python
2 votes232 views2 answers
AttributeError: module 'tensorflow._api.v2.train' has no attribute 'RMSPropOptimizer' site:stackoverflow.com
Python