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

1 vote148 views1 answer
C# multiple button click event to password textbox
C#
0 vote141 views1 answer
How to change argument of function in f#
C#
0 vote136 views1 answer
C# supplier equivalent
C#
1 vote175 views1 answer
How to instatiate particles in unity
C#Unity
0 vote169 views1 answer
DisplayUnitType revit api
C#
1 vote96 views3 answers
C# calculator
C#
2 votes135 views1 answer
C# list.foreach
C#
0 vote165 views1 answer
Razor preview
C#
34 votes145 views6 answers
Most wishlisted games on steam
C#
4 votes101 views3 answers
How to use onmousedown unity
C#