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

19 votes318 views2 answers
Unity RemoveComponent
C#
0 vote304 views1 answer
Github action get commit tag
C#
0 vote318 views1 answer
Unity set mouse
C#
0 vote298 views1 answer
Change image of button c#
C#
2 votes331 views2 answers
Base64 string to byte array c#
C#
1 vote295 views1 answer
Clear gridview data in c#
C#
0 vote293 views1 answer
Unitydont play sound until finsihed
C#
-1 vote309 views1 answer
How to check if a string contains a capital letter c#
C#
0 vote347 views1 answer
C# list with only unique items
C#
0 vote325 views1 answer
C# datagridview cell click event
C#