The sieve of Eratosthenes is a way of computing all the prime numbers below a certain number. (A prime number is a number that is only divisible by itself and 1) Implementing this algorithm should be...

The sieve of Eratosthenes is a way of computing all the prime numbers below a certain number. (A prime number is a number that is only divisible by itself and 1)

Implementing this algorithm should be done without any libraries or importing anything to the program.

• Implement a function crossoutmultiples() that takes as arguments a list of boolean values (true/false) called is_prime and a number n. The function sets the boolean values at all multiples of n (2*n, 3*n, 4*n ...) that are in the list to false.


• Implement a function sieve(n)  which gives back a list of all primes below n.
  the code :
  
  
  
  
  
  
  
  

  def crossoutmultiples(isprime,n) :

  
  

      pass

  
  
  
  

  def sieve(n):

  
  

      pass