Sieve of Eratosthenes

#!/usr/bin/env python

# Sieve of Eratosthenes - to find all the prime numbers in range 1 to n
# http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

def sieve_of_eratosthenes(n):
	primes = []
	numbers = []
	for i in range(2, n+1):
		numbers.append(i)
	while numbers:
		primes.append(numbers.pop(0))
		for e in numbers:
			if not e%primes[-1]:
				numbers.pop(numbers.index(e))
	return primes

def is_prime(n):
	prime_list = sieve_of_eratosthenes(n)
	if n in prime_list:
		return True
	return False