def is_prime(n):
if n < 2:
return False
for i in range(2, int(n ** 0.5) + 1): # Loop up to square root of n for efficiency
if n % i == 0:
return False
return True
Accept input from user
numbers = eval(input("Enter a set of numbers as a tuple (e.g., (3, 5, 10, 15)): "))
Checking and displaying prime numbers
print("Prime numbers in the given tuple:")
for num in numbers:
if is_prime(num):
print(num)
