Answers for "find prime number 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"

python is a number prime

def prime(n):
  if min(n//3,n//2,n//5) == 0: 
    return True
  elif min(n%3,n%2,n%5) == 0: 
    return False
  else: 
    return True

# Super easy to use, and maximum efficiency! No imports needed.
print(prime(732))

def divis(n):
  if prime(n) == True: 
    return (1,n)
  for i in [2,3,5]:
    if n%i == 0: 
      return (i,n/i)

print(divis(735))
# Gets a divisibility pair: Make sure you have also implemented prime() or it may not work.

get prime number python

from num_tool import is_prime
print(is_prime(3))

#returns True because 3 is a prime

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)

prime checker in python

#make the function
#to do this all hte vairibles go in side the function

def CheckIfPrime ():
    a1 = input("which number do you want to check")
    a = int(a1)#you need the checking number as an int not an str
    b = 2 #the number to check againts
    c = ("yes")
    while b < a:#run the loop
        if a%b == 0:#check if the division has a remainder
            c = ("no")#set the answer
        b = b+1
    print(c)#print the output
CheckIfPrime ()#call the function