Write an erastotenes sieve

def sieve(n):
  """
  Given a number n, create a list of all the primes up to n using the erastotenes sieve
  """
  nums = [x for x in range(2,n + 1)]
  for prime in nums:
    for multiple in range(prime ** 2, n + 1, prime):
      if multiple in nums:
        nums.remove(multiple)
  return nums
  
sieve(100)