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

-1 vote238 views1 answer
How to backgrund c# red
C#
33 votes228 views4 answers
How to reload current scene unity
C#
1 vote222 views1 answer
Asp.net data annotations double
C#
1 vote239 views1 answer
Decalre an int list mvc
C#
0 vote238 views1 answer
C# findindex
C#
0 vote269 views1 answer
How to add an assembly reference in c#
C#
0 vote254 views1 answer
Save current dir shell
C#
2 votes245 views2 answers
Or in if statement c#
C#
2 votes218 views1 answer
Start new form c#
C#
25 votes239 views2 answers
Time delay C# unity
C#