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

2 votes170 views2 answers
How to validate if date is a weekday or weekend c#
C#
8 votes174 views1 answer
Unity raycast 2d
C#Unity
1 vote164 views1 answer
Gcd of list of number
C#
33 votes188 views6 answers
C# object to json string
C#
1 vote209 views1 answer
How to stop a coroutine unity c#
C#Unity
0 vote175 views1 answer
Getelement video
C#
1 vote180 views1 answer
C# loop through array of objet
C#
1 vote120 views1 answer
Wpf data context
C#
0 vote171 views1 answer
How to mock abstract httpcontext using moq .net core
C#
2 votes166 views1 answer
Convert string into double in c#
C#