Question

Hey I've just done problem 1a and I prolly need someone to check it for me since i'm totally new to computer programming...
Thanks
Toan
PS: 1st program so far :D
Odd = () # Creating a set of all odd integer

for k in range(3,10000):
if k % 2 != 0:
Odd = Odd + (k,)
Prime = ()
for x in Odd:
for i in Odd:
if i < x:
if x % i == 0:
break
else:
Prime = Prime + (x,)
break
print "Enter a number: "
x = int(raw_input())
print 'The ', x, 'th prime number is: ', Prime[x-2]

Answer 1

That probably works, though it assumes some knowledge about the results. Specifically that the 1000th prime will occur before 10000. It also doesn't end when it finds the 1000th prime. You should be able to verify for yourself that it works correctly, as when it's done it should tell you the 1000th prime.

Answer 2

hm...i got the right result so i guess it works
but its true it doesnt stop when it finds the 1000th prime...
im working on it though i dont know how yet
thanks a lot! :D

Answer 3

Why not change your outermost loop to a while loop rather than a for loop and loop until you've found a certain number of primes (1000).