Найти 100 первых простых чисел

def primes_upto(limit):
prime = [True] * limit
for n in range(2, limit):
if prime[n]:
yield n # n is a prime
for c in range(n*n, limit, n):
prime[c] = False # mark composites

import math
def is_prime1(n):
    for i in range(2, int(math.sqrt(n) + 1)):
        if n % i == 0: 
            return False
    return n > 1
   
def is_prime2(n, d=3):
    if n < 2 or n != 2 and n & 1 == 0:
        return False
    if d * d > n:
        return True
    return n % d and is_prime2(n, d + 2)
 
def is_prime3(n):
    return ~-2 ** n % n < 2
 
def is_prime4(n):
    return sympy.isprime(n)
 
print(is_prime1(2683))
print(2683>1)
 
 
def is_prime3(n):
    return ~-2 ** n % n < 2

n = input("n=")
a = range(n+1)
a[1] = 0
lst = []
 
i = 2
while i <= n:
    if a[i] != 0:
        lst.append(a[i])
        for j in xrange(i, n+1, i):
            a[j] = 0
    i += 1
print lst

i=2
while i<=100:
    f=True
    j=2
    while f and j<i:
        if not i%j: f=False
        j+=1
    if f: print(i,end=' ')
    i+=1

from random import randint
print(randint(0,99))

from random import randint
x=[randint(0,99)]