Advertisement
Guest User

Untitled

a guest
Aug 19th, 2020
145
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.65 KB | None | 0 0
  1. import time
  2. def prime(g,m,n):
  3.     lst = [2]
  4.     if m%2==0:
  5.         m+=1
  6.     k=0
  7.     for i in range(3, n, 2):
  8.         if not k and lst[-1]>=m:
  9.             k=len(lst)
  10.  
  11.         if (i > 10) and (i % 10 == 5):
  12.             continue
  13.         for j in lst:
  14.             if j * j - 1 > i:
  15.                 lst.append(i)
  16.                 break
  17.             if (i % j == 0):
  18.                 break
  19.         else:
  20.             lst.append(i)
  21.     for i in range(k,len(lst)-1):
  22.         if lst[i+1]-lst[i]==g:
  23.             return lst[i],lst[i+1]
  24. starttime=time.time()
  25. print(prime(4,1000000,2000000))
  26. print(time.time()-starttime)
  27. #(1000033, 1000037)
  28. #3.7940053939819336
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement