def is_prime(number):
divisor = 2
while divisor <= number / 2:
if number % divisor == 0:
return False
divisor += 1
return True
def find_prime(n_int):
for i in range(2, n_int):
a = pow(2, i) - 1
if is_prime(a) is True:
print(f"integer {i} prime number is {a}")
else:
continue
# print(f"integer {i} is no prime number is {a}")
find_prime(31)
#没有按题的答案要求排版