Step 1 : Find Prime Numbers
def find_Prime(no) :
div = 2
while div <=no //2 :
if no % div ==0 :
return False
div += 1
else :
return True
no =2
while no <=99 :
result = find_Prime(no)
if result == True:
print("Prime Number", no)
no += 1
Step 2 : smallest and the biggest two digit prime number
def find_prime(no): #12
div = 2
while div <= no//2: #10 Times
if no % div == 0:
return False
div+=1
else:
return True
no = 11
first = True
last_prime = no
while no <= 99:
result = find_prime(no) #Calling Statement
if result == True and first == True:
print("First Prime Number", no)
first = False
elif result == True:
last_prime = no #13 17 19 23 29 31 37 43 47
no+=2
else:
print("Last Prime Number is", last_prime)
Top comments (0)