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 votes149 views1 answer
Json ignore property c#
C#
1 vote145 views1 answer
Avoid autocomplete input text asp.net
C#
0 vote150 views1 answer
C# if debug
C#
1 vote124 views1 answer
C# wpf keyinput DeadCharProcessed
C#
30 votes134 views3 answers
C# if file exists
C#
1 vote160 views1 answer
C# unity control key input
C#Unity
-1 vote150 views1 answer
C# convert ad objectguid to string
C#
-1 vote191 views1 answer
How to add colider in obj in unity 2020
C#
0 vote141 views1 answer
Remove element from sting array c#
C#
0 vote133 views1 answer
Get value from config file c#
C#