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 vote168 views1 answer
C# regex find number in string
C#
0 vote162 views1 answer
C# switch statement
C#
0 vote180 views1 answer
C# create list with range
C#
1 vote140 views9 answers
Unity vector3.lerp
C#
0 vote187 views2 answers
Get the Default gateway address c#
C#
8 votes186 views3 answers
Dotnet core 3.1 get the user that just logged in
C#
0 vote172 views2 answers
Make command prompt hidden c#
C#
3 votes177 views1 answer
C# find item in list
C#
0 vote168 views1 answer
Cmd command see which groups a user is in
C#
28 votes176 views2 answers
C# file exist
C#