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

2 votes157 views3 answers
Unity remove parent
C#Unity
2 votes137 views2 answers
C# create a json object
C#
0 vote131 views1 answer
C# create console for winform
C#
0 vote132 views1 answer
"??" in C#
C#
30 votes126 views3 answers
C# initialize array of objects
C#
1 vote85 views1 answer
Unity get direction to point
C#
1 vote122 views1 answer
Where did mark twain go to school
C#
2 votes131 views1 answer
Get current computer name C#
C#
0 vote128 views1 answer
Wpf relativesource
C#
0 vote123 views1 answer
C# catch multiple exceptions at once
C#