def prime_list(n):
numbers = [True] * n
m = int(n ** 0.5)
for i in range(2, m + 1):
if numbers[i] == True:
for j in range(i+i, n, i):
numbers[j] = False
return len([i for i in range(2,n) if numbers[i] == True])