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

0 vote305 views1 answer
Declare multiple variables in for loop c#
C#
4 votes335 views1 answer
Unity mouse look script 2021
C#
0 vote311 views1 answer
What is the best way to lock cache in asp.net?
C#
20 votes323 views1 answer
How to write switch statement unity
C#
1 vote316 views1 answer
Mvc 5 dropdownlist
C#
0 vote332 views1 answer
Index of item in list C#
C#
0 vote375 views1 answer
Unity hide mouse first person
C#Unity
0 vote323 views1 answer
C# read xml tag value
C#
0 vote324 views1 answer
C# Get all class by namespace
C#
48 votes336 views6 answers
C# remove last character from string
C#