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

1 vote268 views1 answer
Unity agent bake not derecting mesh
C#Unity
0 vote263 views1 answer
C# sort llist
C#
13 votes290 views3 answers
C# join array
C#
0 vote284 views2 answers
C# aspx return image
C#
11 votes289 views3 answers
C# loop string array
C#
0 vote252 views1 answer
Clear highlight winforms treeview
C#
0 vote263 views1 answer
How to create vg in aix
C#
0 vote285 views1 answer
Dapper c# insert range
C#
9 votes299 views3 answers
3d perlin noise unity
C#Unity
0 vote270 views1 answer
Remove access to admin from deleting the file in C#
C#