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 vote148 views1 answer
Microsoft flight simulator 2020 camera
C#
2 votes164 views2 answers
Convert list to ienumerable
C#
0 vote141 views1 answer
Nunit cleanup after all tests
C#
0 vote157 views1 answer
Filter list contents with predicate (anonymous method)
C#
0 vote150 views1 answer
C# write to lines without extra line
C#
0 vote136 views1 answer
Get Mouse World Position
C#
0 vote143 views2 answers
While coding c# i get the error : "Duplicate 'global::System.Runtime.Versioning.TargetFrameworkAttribute' attribute [first_better_project]"
C#
0 vote153 views1 answer
Open aspx page c#
C#
-1 vote154 views1 answer
Strinng.indexOf c#
C#
0 vote155 views1 answer
Deploy .net core
C#