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 vote335 views1 answer
Epplus how to align text to right
C#
0 vote289 views1 answer
Params keycord as var name c#
C#
0 vote271 views1 answer
String reduction in c#
C#
6 votes269 views2 answers
Play sound unity
C#
0 vote284 views1 answer
C# parsing datetime from string irrespctive of culture
C#
1 vote227 views1 answer
C# concant 2 tab
C#
2 votes280 views1 answer
Restclient basic auth c#
C#
1 vote297 views2 answers
Modify middleware response c# .net
C#
0 vote310 views1 answer
Auto select file in Solution Explorer from its open tab
C#
-1 vote255 views1 answer
Unity get layermask
C#