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

23 votes192 views3 answers
Unity player movement script 3d
C#
0 vote187 views1 answer
Count number of properties on an object C#
C#
1 vote191 views2 answers
C# get hwid
C#
0 vote194 views1 answer
C# tell if list object is empty
C#
0 vote262 views1 answer
List of border roleplays roblox
C#
2 votes179 views1 answer
Draw sphere gizmo unity
C#
1 vote176 views1 answer
C# using file.io
C#
1 vote246 views1 answer
C# how to output in between 0 - 100 in an int array
C#
1 vote365 views1 answer
C# 1 minute delay
C#
0 vote191 views1 answer
C# today, yesterday, last week, last month
C#