Answers for "is prime in 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"

is_prime in python

# Program to check if a number is prime or not

#too take the input from user use "num: int = int(input('Give the value of num '))"
num: int = int(input('Give the value of Num: '))

# define a variable felix
felix = False

# prime numbers are greater than 1
if num > 1:
    # check for factors
    for i in range(2, num):
        if (num % i) == 0:
            # if factor is found, set flag to True
            felix = True
            # break out of loop
            break

# check if flag is True
if felix:
    print(num, "is not a prime number")
else:
    print(num, "is a prime number")

prime number in python

import math
a=[i for i in range(2,int(input('prime number range'))) if 0 not in [i%n for n in range(2,int(math.sqrt(i)))]]
print(a)

what is the most efficient way to find prime in python

isaacobAns