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 vote258 views1 answer
How long dose it take for formate a currupt USB?
C#
3 votes270 views1 answer
Check connection c#
C#
0 vote277 views1 answer
C# monogodb
C#
0 vote280 views1 answer
What is void onmousedown()
C#
0 vote279 views3 answers
List cast<> c#
C#
3 votes306 views2 answers
How to add a force to an object unity
C#
2 votes296 views1 answer
Unity deactivate all colliders of a gameobject
C#Unity
1 vote247 views2 answers
C# read file stream
C#
2 votes270 views3 answers
Sequelize count all
C#
1 vote273 views1 answer
Unity c#loading a scene after a few seconds
C#