# Implement the sieve of eratosthenes and use it to find all prime

Python
Implement the Sieve of Eratosthenes and use it to find all prime numbers less than or equal to one million. Use the result to prove Goldbach’s Conjecture for all even integers between four and one million, inclusive. Implement a method with the following declaration:

def sieve(list):

This function takes a list of integers as its argument. The list should be initialized to the values 1 through 1000000. The function modifies the list so that only the prime numbers remain; all other values are changed to zero. This function must be written to accept a list of integers of any size. You should output for all primes numbers between 1 and 1000000, but when I test your function it may be on an list of a different size. The number will be specified at runtime (i.e. use the ‘input’ function). Implement a method with the following declaration:

def goldbach(list):

This function takes the same argument as the previous method and displays each even integer between 4 and 1000000 with two prime numbers that add to it. The goal here is to provide an efficient implementation. This means no multiplication, division, or modulus when determining if a number is prime. It also means that the second method must find two primes efficiently. Output for your program: All prime numbers between 1 and 1000000 and all even numbers between 4 and 1000000 and the two prime numbers that sum up to it.

Print all the prime number like

2
3
5
7
17
19
23

4=2+2

6=3+3

8=3+5

10=3+7

12+ 5+7

it should continue until we get all print

The post Implement the sieve of eratosthenes and use it to find all prime appeared first on oneacademyessays.