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

0 vote258 views1 answer
How to get length of okobjectresult c#
C#
0 vote226 views1 answer
Asp.net session empty cehck
C#
2 votes227 views10 answers
Lol
C#
1 vote191 views1 answer
C# func with no return
C#
0 vote207 views1 answer
Unity check if swipe not tap
C#
0 vote206 views1 answer
Angular === vs ==
C#
0 vote195 views1 answer
This site can’t be reachedlocalhost unexpectedly closed the connection. .net framework
C#
0 vote228 views1 answer
Milliseconds to seconds C#
C#
1 vote206 views1 answer
Unity put children in list
C#
0 vote217 views1 answer
How to solo squad in fortnight
C#