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 vote164 views1 answer
C# reflection create generic type
C#
10 votes172 views2 answers
Convert array from string to int c#
C#
0 vote164 views1 answer
Membership get user id
C#
1 vote176 views1 answer
Developer jokes
C#
28 votes187 views3 answers
Unity check gameobject active
C#Unity
2 votes148 views3 answers
Unity always rotating object
C#
31 votes193 views3 answers
Create new gameobject unity
C#Unity
2 votes165 views1 answer
C# print out whole object
C#
25 votes187 views4 answers
Movetowards unity
C#
24 votes176 views2 answers
Unity destroy self
C#Unity