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 vote190 views1 answer
Bubble sort recursive c#
C#
0 vote224 views1 answer
Color' does not contain a definition for red' c#
C#
0 vote208 views1 answer
Filter list contents with predicate (Lambda)
C#
1 vote239 views1 answer
Unity3d quaternion add 90 degrees
C#
3 votes221 views1 answer
C#: convert array of integers to comma separated string
C#
0 vote198 views3 answers
C3 compare hour
C#
1 vote208 views1 answer
How to store an array inside an array c#
C#
0 vote191 views1 answer
How to play multiple sound at once on c# windows form
C#
0 vote183 views1 answer
Connection string .net core
C#
6 votes191 views2 answers
C# remove character from string at index
C#