Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import time
- def prime(g,m,n):
- lst = [2]
- if m%2==0:
- m+=1
- k=0
- for i in range(3, n, 2):
- if not k and lst[-1]>=m:
- k=len(lst)
- if (i > 10) and (i % 10 == 5):
- continue
- for j in lst:
- if j * j - 1 > i:
- lst.append(i)
- break
- if (i % j == 0):
- break
- else:
- lst.append(i)
- for i in range(k,len(lst)-1):
- if lst[i+1]-lst[i]==g:
- return lst[i],lst[i+1]
- starttime=time.time()
- print(prime(4,1000000,2000000))
- print(time.time()-starttime)
- #(1000033, 1000037)
- #3.7940053939819336
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement