for ps1 i thought i did the code correctly but i guess not. what's wrong with it?

#initializing variables
x=1
count=1
countmax=5000
prime=(2,)
#generating a large list of odd integers
while count

Question

for ps1 i thought i did the code correctly but i guess not. what's wrong with it?

#initializing variables
x=1
count=1
countmax=5000
prime=(2,)
#generating a large list of odd integers
while count<countmax:
    x=x+2
    count=count+1
#creating test for determining if odd integer is prime

    for i in range(1,x):
        if x%i!=0:
            print x
          

#adding prime integer to tuple
            
            
print prime

anonymous · Answer

please use a code pasting site http://codepad.org/x2OD1IoK you have a loop that starts at line 12 and tests x for primeness x is only prime if it passes the test for all the numbers in the range as the tests are running if any single test in the loop fails, you need to preserve that so when the loop exits you will know if the number is prime

coolguy123 · Answer

ah like defensive programming? and how do i preserve the variable when the loop exits to check?

coolguy123 · Answer

http://codepad.org/wX9S9q2N

coolguy123 · Answer

also adding the prime tuple to the tuple (x,) didn't work for me

anonymous · Answer

variables or data structures are useful for preserving information http://dpaste.com/715157/

coolguy123 · Answer

ok so what should i do to fix my code?

anonymous · Answer

test each number (n) to see if it is evenly divisible by any divisor between 1 and n-1
if it is evenly divisible by any of those divisors it is NOT prime
if it is NOT evenly divisible by any of those divisors it IS prime
everytime you find a prime number print it or add it to a data structure (list, tuple, ...)
when you have found the number of primes you need stop