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

3 votes109 views2 answers
C list add element
C#
0 vote99 views1 answer
Fit a picture picturbox c#
C#
0 vote130 views1 answer
Instantiate unity in parent
C#Unity
0 vote118 views1 answer
Reverse a linked list C#
C#
1 vote106 views1 answer
Get all sundays between two dates c#
C#
13 votes134 views3 answers
Print random number unity
C#Unity
7 votes121 views1 answer
Built in methods to order a list c#
C#
2 votes127 views3 answers
Convert string to list int c#
C#
0 vote125 views1 answer
Multidimensional meaning
C#
0 vote111 views1 answer
Unity 3d animator live link
C#