<jupyter_start><jupyter_text>**<NAME>** **Sieve of Eratothenes**The idea is to create a list of all numbers and check all to see if they are divisible by any number other than itself and zero. In this we cut any number that is found as not prime. We do this in our code by starting with a list with 2 in it. Then we add numbers to the list. Then a new function checks the numbers to see if they are divisible by anything. Then a new function calls on the last number in the list and reads it back.<jupyter_code>import primes.py
primes.eratosthenes(20)<jupyter_output><empty_output><jupyter_text>**Benchmarking Implementations**<jupyter_code>import primes
%time primes.eratosthenes(1000)
import primes
%time primes.eratosthenes(1000)
** Generating Prime Numbers**
This design helps eliminate the numbers that are nto prime and work over every factor.
def eratosthenes(n):
    """Verify the number of primes less than 200.
    """
    primes = []
    for primes in range(1,n):
        primes.append(i)
    for i in primes:
        for n in primes:
            if prime(n)// i= 0:
                primes.pop(n)<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.07563764291996482, 'fraction_numerical': 0.014072119613016711, 'mean_word_length': 3.8220338983050848, 'pattern_counts': {'":': 0, '<': 10, '<?xml version=': 0, '>': 10, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '2', 'dir': 'jupyter-structured-clean-dedup', 'id': '291287', 'license': 'MIT', 'n_tokens_mistral': 366, 'n_tokens_neox': 342, 'n_words': 152, 'path': 'cw04-BenJessica.ipynb', 'repo_name': 'chapman-phys220-2018f/cw04-ben-jessica', 'size': '1146'}