|
(Python)
p1=2
n=2
count=0
while p1>2:
....## Generate the pair
....cc=[]
....cc.append(p1)
....for i in range(1, n):
........cc.append((2**(i)*p1+((2**i)-1)))
....## chain entries cubed + 2
....cc2=[(c*c*c)+2 for c in cc]
....## chain entries power to 5 + 2
....cc3=[(c**5)+2 for c in cc]
....## check if cc is a Sophie Germain Pair or not
....## pf.isp_list returns True or false for a given list of numbers
....## if they are prime or not
....##
....pcc=pf.isp_list(cc)
....pcc2=pf.isp_list(cc2)
....pcc3=pf.isp_list(cc3)
....## Number of primes for cc, cc2, cc3
....npcc=pcc.count(True)
....npcc2=pcc2.count(True)
....npcc3=pcc3.count(True)
....if npcc==n and npcc2==n and npcc3==n:
........print "For length ", n, " the series is : ", cc, ", ", cc2 , " and ", cc3
....p1=pf.nextp(p1)
| 