else for for
in python
def find_prime(n): for i in range(2, int(n**0.5) + 1): if n % i == 0: print(f"{n} is divisible by {i}, hence not a prime.") break else: # This else corresponds to the for loop print(f"{n} is a prime number.") find_prime(29) find_prime(30)