(Python)
import sympy
## isp_list returns an array of true/false for prime number test for a
## list of numbers
def isp_list(ls):
....pt=[]
....for a in ls:
........if sympy.ntheory.isprime(a)==True:
............pt.append(True)
....return(pt)
co=1
while co > 0:
....al=0
....n=2
....while al!=co:
........d=[]
........for i in range(0, co):
............d.append(int(n**((2*i)+1))-4)
........al=isp_list(d).count(True)
........if al==co:
............## Prints prime number and its corresponding sequence d
............print(n, d)
........n=sympy.ntheory.nextprime(n)
....co=co+1
|