num = 10

for i in range(2,num+1):

    for j in range(2,i):

        if(i%j == 0):

            break

    else:

        print(i)

# Thanks to https://www.codegrepper.com/profile/farid

# Just tune his answer into easy to use function

​

def prime_numbers(start_num, end_num):

    for number in range(start_num , end_num + 1):

        is_prime = True

        for counter in range(2,number):

            value = number % counter

            if value == 0:

                is_prime = False

                break

        if is_prime == True:

            print(number)

def is_prime(n):

  for i in range(2,n):

    if (n%i) == 0:

      return False

  return True

import math

prime = int(input("Enter your number: "))

count = 0

sqr = int(math.sqrt(prime))

for i in range(2, sqr+1):

    if prime % i == 0:

        print("your number is not prime")

        count += 1

        break

if count == 0:

    print("your number is prime")

lower = int(input("Enter lower range: "))  

upper = int(input("Enter upper range: "))  

for num in range(lower,upper + 1):  

   if num > 1:  

       for i in range(2,num):  

           if (num % i) == 0:  

               break  

       else:  

           print(num)