/Python/Determine if number is prime python

Determine if number is prime python

# Time Efficient Primality Check in Python

def primeCheck(n):
    # 0, 1, even numbers greater than 2 are NOT PRIME
    if n==1 or n==0 or (n % 2 == 0 and n > 2):
        return "Not prime"
    else:
        # Not prime if divisable by another number less
        # or equal to the square root of itself.
        # n**(1/2) returns square root of n
        for i in range(3, int(n**(1/2))+1, 2):
            if n%i == 0:
                return "Not prime"
        return "Prime"

Check for prime in python

def is_prime(n: int) -> bool:
    """Primality test using 6k+-1 optimization."""
    import math
    if n <= 3:
        return n > 1
    if n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i <= math.sqrt(n):
        if n % i == 0 or n % (i + 2) == 0:
            return False
        i += 6
    return True

Source: en.wikipedia.org

How to see if a number is prime in python

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

Similar codes

0 vote151 views1 answer
Python disable logging on unittest
Python
35 votes166 views2 answers
How to run cmd line commands in python
Python
0 vote147 views2 answers
Python test if you can convert to int
Python
0 vote158 views1 answer
Tkinter text blurry
Python
0 vote149 views1 answer
Presto sequence example date
Python
0 vote157 views1 answer
How to change kivy button size
Python
2 votes150 views2 answers
Update python in miniconda
Python
5 votes263 views6 answers
Fibonacci series in python
Python
0 vote152 views1 answer
Sklearn euclidean distance
Python
1 vote158 views1 answer
Python append n numbers to list
Python