Question

PYTHON! The Sieve of Eratosthenes THANKS FOR HELP!

A prime integer is any integer greater than 1 that is evenly divisible only by itself and 1. The Sieve of Eratosthenes is a method of finding prime numbers. It operates as follows:

Create a list with all elements initialized to 1 (true). List elements with prime indexes will remain 1. All other elements will eventually be set to zero.

Starting with list element 2, every time a list element is found whose value is 1, loop through the remainder of the list and set to zero every element whose index is a multiple of the index for the element with value 1. For list index 2, all elements beyond 2 in the list that are multiples of 2 will be set to zero (indexes 4, 6, 8, 10, etc.); for list index 3, all elements beyond 3 in the list that are multiples of 3 will be set to zero (indexes 6, 9, 12, 15, etc.); and so on.

When this process is complete, the list elements that are still set to 1 indicate that the index is a prime number. These indexes can then be printed. Write a program that uses a list of 1000 elements to determine and print the prime numbers between 2 and 999. Ignore element 0 of the list. The prime numbers must be printed out 10 numbers per line.

I use the def function, but i cant figure out x%multipliers ==0 in a loop.
Sample execution: Python 3.64 Shell File Edit Shell Debug Options Window Help Python 3.6.4 (v3.6.4:d48eceb, Dec 19 2017, 06:04:45) [MSC v.1900 32 bit (Intel) on win32 Type "copyright", "credits" or "license ()" for more information RESTART: P:\Cmpsc131\Programming Assignment Solutions \EC2PrimeNumberGenerator.py Prime numbers between 2 and 999 as determined by the Sieve of Eratosthenes 2 3 5 7 11 13 17 19 23 29 31 3741 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367373 379 383 389 397 401 409 419 421 431433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967971 977 983 991 997

Answer 1

######################## PGM START #############################################

def Sieve_Of_Eratosthenes(limit):
  
    # Create an array "priArray[0..n]" and initialize
    # all entries it as 1. A value in p[i] will
    # finally be 0 if i is not a prime, else the
    # value will be true.
   priArray=[];
    for i in range(limit+1):
        priArray.append(1);
  
    p = 2;
    while (p * p <= limit):
        # If priArray[p] is not changed, then it is a prime
        if (priArray[p] == 1):
            # Update all multiples of p
            i=p*2;
            while(i<=limit):
                priArray[i] = 0;
                i=i+p;
        p += 1
    
    # Print all prime numbers
   count=0
    for i in range(2, limit):
        if priArray[i]:
            print(i,end=" ")
            count+=1
        if(count==10):
            print("")
            count=0

# driver program
if __name__=='__main__':
    upper_Limit = 1000;
    print ("Prime number between 2 and 999 as determined by Sieve Of Eratosthenes")
    Sieve_Of_Eratosthenes(upper_Limit)

######################### PGM END ########################################
OUTPUT
########