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 vote276 views1 answer
Linq from multiple tables
C#
5 votes303 views1 answer
Unity call function on animation onstateexit
C#
0 vote268 views2 answers
Select from list where not in other list c#
C#
0 vote305 views1 answer
Upgrade asp.net core to 5.0
C#
0 vote312 views1 answer
Worldtimebuddy
C#
3 votes333 views1 answer
Mailkit send attachment
C#
0 vote298 views1 answer
How to read particular line of file in c#
C#
1 vote338 views1 answer
Unity knowing when 0 input is pressed
C#Unity
0 vote281 views1 answer
C# split string by index
C#
0 vote344 views1 answer
How to turn camera space to world space unity
C#Unity