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 vote267 views1 answer
Dependency Injection Create Scope at constructor
C#
0 vote193 views1 answer
Add spaces in string
C#
1 vote182 views1 answer
Access a local varible in a different function C#
C#
0 vote175 views1 answer
List of 2 different iherent classes c#'
C#
0 vote226 views1 answer
How to input data several times in c#
C#
3 votes242 views3 answers
2d rotation unity
C#Unity
0 vote244 views1 answer
C# changimg to one decimal place
C#
0 vote236 views1 answer
Destructure array in c#
C#
0 vote185 views1 answer
System.net.mail send html message
C#
0 vote200 views1 answer
C# if debug
C#