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 vote135 views1 answer
Python ip location lookup
Python
6 votes141 views4 answers
Python plot horizontal line
Python
1 vote161 views1 answer
Discord.py check if message has certain reaction
Python
0 vote146 views1 answer
Star rating form in flask
Python
2 votes192 views2 answers
Cv2 crop image
Python
1 vote156 views1 answer
The python libraries to master for machine learning
Python
0 vote140 views1 answer
Plt tight layout
Python
2 votes208 views1 answer
Urlpatterns += static(r'^static/(?P<path>.*)$', 'django.views.static.serve', {'document_root': settings.STATIC_ROOT})
Python Django
1 vote147 views1 answer
Button position python
Python
0 vote150 views1 answer
Pandas read csv encoding thai
Python