python generator prime numbers

1# Prime number generator
2def prime_generator(end):
3    for n in range(2, end):     # n starts from 2 to end
4        for x in range(2, n):   # check if x can be divided by n
5            if n % x == 0:      # if true then n is not prime
6                break
7        else:                   # if x is found after exhausting all values of x
8            yield n             # generate the prime
9
10
11g = prime_generator(1000)       # give firt 1000 prime numbers
12print(list(g)) 

1# effiecent and fast way to generate prime numbers
2def primeCheck(n):
3    if n == 1 or n == 0 or (n % 2 == 0 and n > 2):
4        return False
5    else:
6        for o in range(3, int(n ** (1 / 2)) + 1, 2):
7            if n % o == 0:
8                return False
9        return True
10
11
12for a in range(2**15):
13    if primeCheck(a):
14        prime_numbers.append(a)