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

6 votes104 views1 answer
Ef core dbfirst
C#
8 votes102 views2 answers
Asp.net core get request ip address
C#
0 vote93 views1 answer
@using System,System.Core
C#
0 vote98 views1 answer
Browser folder in wpf
C#
12 votes93 views2 answers
C# messagebox yes no "wpf"
C#
0 vote93 views1 answer
Accord.io read .mat file
C#
3 votes97 views3 answers
C# array max
C#
0 vote97 views1 answer
C# asqueryable select
C#
1 vote132 views1 answer
Unity detect keyboard not mouse
C#Unity
-2 votes116 views1 answer
C# object set property
C#