anonymous
  • anonymous
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]
MIT 6.00 Intro Computer Science (OCW)
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
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.
anonymous
  • anonymous
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
anonymous
  • anonymous
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).

Looking for something else?

Not the answer you are looking for? Search for more explanations.