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 vote189 views1 answer
Command to add entity framework layer in existing database
C#
0 vote180 views3 answers
Bundle.config in mvc is missing
C#
0 vote175 views2 answers
Wpf yes no message box exit
C#
0 vote200 views1 answer
Unity time.fixeddeltatime
C#Unity
4 votes207 views2 answers
Unity clamp rotation
C#Unity
2 votes194 views1 answer
Draw sphere gizmo unity
C#
5 votes210 views1 answer
Load prefab in script unity
C#Unity
4 votes226 views1 answer
Unity cast int to float
C#
1 vote191 views1 answer
Unity cancel invoke
C#
3 votes173 views1 answer
Unity c# on trigger enter with specific gameobject
C#