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 vote216 views3 answers
Query string not ending with with vowels
C#
1 vote205 views1 answer
Unity rigid body variable
C#
3 votes162 views1 answer
C# get number of files in directory
C#
29 votes181 views3 answers
Online embedded c compiler
C#
27 votes245 views3 answers
Unity get textmesh pro component
C#Unity
0 vote242 views1 answer
How prevent user remove file linux
C#
11 votes153 views2 answers
Unity raycast 2d
C#
0 vote162 views1 answer
Textblock line break
C#
3 votes230 views1 answer
Unity how to change the text on a button
C#Unity
0 vote152 views1 answer
Initialization of dictionary in other forms c#
C#