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 vote114 views2 answers
How to close another app in system with c#
C#
0 vote109 views1 answer
Xamarin Forms iOS Picker done
C#
2 votes125 views1 answer
C# get certain character from string
C#
35 votes124 views2 answers
How to delete from a list c#
C#
0 vote110 views1 answer
Is keyboard clicked in Unity
C#
0 vote124 views4 answers
How to integrate a c# and angular 9
C#
15 votes103 views5 answers
Call function from another script unity
C#
0 vote111 views1 answer
Conditional middleware .net core
C#
0 vote128 views1 answer
Lump in neck under jaw
C#
0 vote116 views2 answers
How to textbox anywhere on chart in c#
C#