()
| 13 | return all(number % i for i in range(3, int(math.sqrt(number)) + 1, 2)) |
| 14 | |
| 15 | def prime_generator(): |
| 16 | num = 2 |
| 17 | while True: |
| 18 | if primeCheck(num): |
| 19 | yield num |
| 20 | num+=1 |
| 21 | |
| 22 | def main(): |
| 23 | n = int(input('Enter The N\'th Prime Number You Want To Get: ')) # Ask For The N'th Prime Number Wanted |