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

-1 vote128 views3 answers
Raw sql query to django converter
Python Django
0 vote108 views1 answer
Numpy stack arrays vertically
Python
0 vote109 views1 answer
Python use numphy
Python
0 vote114 views1 answer
How did you determine the chromosome numbers and how does that relate to heredity?
Python
14 votes105 views5 answers
How to read a excel file in python
Python
15 votes106 views3 answers
Group by 2 columns pandas
Python
0 vote155 views1 answer
Type object 'SparkContext' has no attribute '_jsc'
Python
0 vote61 views1 answer
First rows of data frame (specify n by param)
Python
0 vote97 views3 answers
Pandas pivot table
Python
24 votes104 views2 answers
Make an executable with visual studio python
Python