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

0 vote141 views1 answer
Python requirments.txt
Python
7 votes184 views5 answers
Pillow create image
Python
12 votes184 views3 answers
Python datetime day of year
Python
0 vote145 views1 answer
Tuple: Tuple cannot change
Python
2 votes174 views1 answer
Python argparse ignore unrecognized arguments
Python
0 vote154 views1 answer
Equivalent of setInterval python
Python
1 vote163 views1 answer
Flatten a 2d array python
Python
-2 votes148 views2 answers
Entered_text_1 = textbox_1.get(1.0, tk.END+"-1c")
Python
0 vote149 views1 answer
Read_csv only certain columns
Python
149 votes222 views6 answers
How to make a random number generator in python
Python