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

-2 votes108 views3 answers
Python list of all characters
Python
-1 vote112 views1 answer
Django custom primary key field
Python
0 vote106 views1 answer
Python string with si suffix to number
Python
2 votes126 views2 answers
Sort by multiple keys in object python
Python
3 votes119 views3 answers
2d array python initialize
Python
3 votes116 views2 answers
Python use variable in another file
Python
1 vote106 views1 answer
Plt.plot width line
Python
0 vote112 views1 answer
I = 1 while i <= 100: print(i * *") i = i + 1
Python
37 votes99 views4 answers
How to create miniconda environment
Python
0 vote112 views1 answer
Programme phyton pour realiser un programme qui transforme une image en niveau de gris
Python