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 vote311 views1 answer
C# remove newline from string
C#
1 vote300 views1 answer
If exist TempData[] c#
C#
0 vote352 views1 answer
Monogame print
C#
1 vote301 views1 answer
C# max two values
C#
3 votes345 views2 answers
Unity create empty gameobject in code
C#
0 vote339 views1 answer
Unity deactivate scripts in list
C#
0 vote343 views1 answer
Unity dotween sequence
C#
2 votes322 views1 answer
How to get specific length of row in matrix c#
C#
0 vote361 views1 answer
String length f#
C#
37 votes457 views3 answers
Debug.log unity
C#Unity