Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- x = 1
- u = 8793
- s1 = []
- s2 = []
- k = 0
- y = 1
- # get and store prime numbers between 1 and 8793 in s1
- while x < u:
- if x.is_prime():
- s1 = s1 + [x]
- x = x + 1
- # interate over the prime numbers and store the prime twins in s2
- while s1[y] < s1[len(s1) - 1]:
- if (s1[k] + s1[y]) == ((s1[k]) + (s1[k] + 2)):
- s2 = s2 + [s1[k]]
- s2 = s2 + [s1[y]]
- k = k + 1
- y = y + 1
- #output prime twins
- print s2
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement