前5个默尼森数

from math import sqrt

def isprime(x):
if x == 1:
return False
k = int(sqrt(x))
for j in range(2,k+1):
if x%j == 0:
return False
return True

def moni():
count=0
list=[]
p = 2
while True:
if isprime(p):
m=2**p-1
if isprime(m):
list.append(m)
count+=1
if count ==5:
break

p+=1
return list

list=moni()
print(list)
[3, 7, 31, 127, 8191]