nanokatka

collections4

Feb 17th, 2020
59
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.76 KB | None | 0 0
  1. """
  2. 4. Make a set of first X primary numbers (X entered from keyboard).
  3. Print out the set.
  4. 4.1. Transform set into ordered sequence of numbers and print out again.
  5. """
  6.  
  7. counter=int(input("enter number"))
  8. primes=set()
  9. first = 1
  10. last = 1000000 #not elegant..... I tried while counter > 0 and then decrease the counter every time I find prime, but did not work well... ever....
  11.  
  12. for val in range(first, last + 1):
  13. if val > 1:
  14. for n in range(2, val):
  15. if (val % n) == 0:
  16. break
  17. else:
  18. primes.add(val)
  19. if len(primes)==counter:
  20. break
  21. else:
  22. first=last
  23. last=first+1
  24. print(primes)
  25.  
  26. primes2=list(primes)
  27. primes2.sort()
  28. print(primes2)
Add Comment
Please, Sign In to add comment