Prime number algorithm

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

Prime number algorithm

bool IsPrime(int n)
{
    if (n == 2 || n == 3)
        return true;

    if (n <= 1 || n % 2 == 0 || n % 3 == 0)
        return false;

    for (int i = 5; i * i <= n; i += 6)
    {
        if (n % i == 0 || n % (i + 2) == 0)
            return false;
    }
    return true;
}

Source: en.wikipedia.org

Similar codes

4 votes374 views1 answer
How to get rigidbody speed in unity
C#Unity
1 vote326 views1 answer
Unity asset storre download forlder
C#
0 vote334 views1 answer
.net framework method
C#
0 vote349 views1 answer
Close an open form when you open it again c#
C#
0 vote330 views1 answer
Forces the user to enter his password before submitting the form asp.net core
C#
0 vote321 views1 answer
Webbrowser control feature_browser_emulation compatible
C#
0 vote322 views1 answer
Query Parent-GrandChild collection
C#
3 votes408 views1 answer
Decimal sql how is on c#
C#
0 vote371 views1 answer
Mysqldump - date
C#
1 vote362 views1 answer
How custom them of ckeditor
C#