Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import math
- def primzahl(n):
- if n == 1:
- return False
- for i in range(2, int(math.sqrt(n))+1):
- if n % i == 0:
- return False
- return True
- def prime_numer_generator(n):
- primzahlen = []
- for i in range(2, n+1):
- if primzahl(i):
- primzahlen.append(i)
- return primzahlen
- def primzahlzwilling(primzahlen):
- primzahlzwillinge = []
- for i in range(len(primzahlen)):
- if primzahlen[i] + 2 in primzahlen:
- primzahlzwillinge.append(primzahlen[i])
- return primzahlzwillinge
- def main():
- n = 2000
- primzahlen = prime_numer_generator(n)
- primzahlzwillinge = primzahlzwilling(primzahlen)
- print(primzahlzwillinge)
- if __name__ == '__main__':
- main()
Advertisement
Add Comment
Please, Sign In to add comment