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 vote409 views1 answer
Unknown discriminator value mongodb
C#
0 vote355 views1 answer
C# check if object can be cast to type
C#
3 votes398 views2 answers
C# is not marked as serializable
C#
26 votes410 views3 answers
Print in c# unity
C#Unity
0 vote337 views1 answer
Github action get commit tag
C#
8 votes350 views3 answers
C# increment by 1
C#
4 votes381 views1 answer
Unity play particle system
C#
0 vote354 views1 answer
Ef core unique index
C#
0 vote344 views1 answer
.net core authorizationhandlercontext
C#
0 vote335 views2 answers
Stringify c#
C#