Question

Ex-28. Loops. Construct pseudocode and flowchart to determine if integer N is prime

. [Python]

Answer 1

`Hey,

Note: If you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

Note: Brother sometimes while uploading on HomeworkLib the indentations change. So, I request you to verify it with screenshot once. This is the link where I have saved the code too

https://onlinegdb.com/By9uixbVI

# Python program to check if the input number is prime or not
#Take input from the user
num = int(input("Please enter the number: "))
#Check if the given number is greater than 1
if num > 1:
  
# Iterate from 2 to n / 2
for i in range(2, num//2):

# If num is divisible by any number between
# 2 and n / 2, it is not prime
if (num % i) == 0:
print(num, "is not a prime number")
break
else:
print(num, "is a prime number")
  
else:
print(num, "is not a prime number")

Kindly revert for any queries

Thanks.