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
- #1. versuch
- def prim(n):
- counter = 0
- for i in range(1,n+1):
- if ((n % i)==0):
- counter +=1
- if (counter > 2):
- return False
- return True
- #gekürtzt
- def isPrim(n):
- for i in range(2,n):
- if ((n % i)==0):
- return False
- return True
- #-----------------------------------------------------------
- #Aufgabe 3
- def prim(n):
- counter = 0
- prims = []
- for i in range(n, 0, -1):
- if(isPrim(i)):
- counter +=1
- prims.append(i)
- print("Es liegen ",counter," Primzahlen unter ",n)
- print("Diese sind:")
- return prims
- def prime(n):
- counter = 0
- prims = []
- for i in range(n, 0, -1):
- if(isPrim(i)):
- counter +=1
- prims.append(i)
- return prims
- #-------------------------------------------------------------
- #Aufgabe 4
- #eine Zerlegung (größt mögliche)
- def zerlegung(n):
- if (isGerade(n)):
- possiblenumbers = prime(n)
- sint = 0
- prims = []
- while(sint != n):
- for i in range(0, len(possiblenumbers)):
- if (sint+possiblenumbers[i] <= n):
- sint = sint + possiblenumbers[i]
- prims.append(possiblenumbers[i])
- print("Mann kann 22 in ",prims," zerlegen")
- else:
- print("Es muss eine gerade Zahl sein")
- def zerlegungen(n):
- if (isGerade(n)):
- possiblenumbers = prime(n)
- sint = 0
- prims = []
- while(True):
- while(sint != n):
- for i in range(0, len(possiblenumbers)):
- if (sint+possiblenumbers[i] <= n):
- sint = sint + possiblenumbers[i]
- prims.append(possiblenumbers[i])
- if(len(prims) == 3):
- return
- else:
- print("Mann kann", n
- ," in ",prims," zerlegen")
- possiblenumbers.remove(possiblenumbers[0])
- sint = 0
- prims = []
- else:
- print("Es muss eine gerade Zahl sein")
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement