Coding
Reference

Sieve of Eratosthenes

In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite (i.e., not prime) the multiples of each prime, starting with the first prime number, 2

def Primes(upperLimit):
	primes = list(range(2,upperLimit+1))
	for i in primes:
		j = 2
		while i * j <= primes[-1]:
			if i * j in primes:
				primes.remove(i*j)
			j += 1
	print(primes)

Entry = input('Primes: ')  
x = int(Entry)  
Primes(x)