python prime number program code example

Example 1: 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.

Example 2: prime number in python

def prime(num):
    if num>1:
        s=int(num/2)
        for i in range(2,s+1):
            if num%i==0:
                return("not prime")
                break
        return("prime")
print(prime(239))

Example 3: list of prime numbers in python

n = 20
primes = []

for i in range(2, n + 1):
	for j in range(2, int(i ** 0.5) + 1):
 		if i%j == 0:
 			break
	else:
		primes.append(i)

print(primes)

Example 4: 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

Example 5: check if a number is prime python

n=input('Enter the number you want to check: ')
try:
    n=int(n)
except:
    print('Wrong input.')
    quit()
if n==1 or n==0:
    print('This is neither prime nor composite')
else:
    c=0
    for i in range(2,n):
        if n%i==0:
            c=c+1
    if c==0:
        print("This is a prime number")
    else:
        print('This  is a composite number.')