Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #Aufgabe 1
- def isGerade(n):
- if((n%2)==0):
- return True
- return False
- #Aufgabe 2
- def isPrim(n):
- for i in range(2,n):
- if ((n % i)==0):
- return False
- return True
- #Aufgabe 3
- def nextprim(n):
- counter = 0
- if(isPrim(n)):
- prims = 1
- else:
- prims = 0
- while(True):
- if(isPrim(n-counter)):
- prims+=1
- counter += 1
- if(n-counter == 1):
- return prims
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement