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 vote133 views1 answer
Int to ascii c#
C#
3 votes159 views1 answer
Unity desactivate collider
C#Unity
0 vote101 views1 answer
C# dapper execute stored procedure with parameters
C#
0 vote137 views1 answer
Unity convert number to notation
C#Unity
0 vote106 views1 answer
C# create default instance of type
C#
2 votes119 views2 answers
Unity don't destroy on load
C#
0 vote100 views1 answer
C# String Manipulation:
C#
4 votes111 views3 answers
Regular expression for email in c#
C#
0 vote98 views1 answer
What loops are entry controlled c#
C#
0 vote102 views1 answer
How to split string into a list ignoring number of spaces c#
C#