Hi! Fellow OCW students! I have a question about problem 1 on problem set 1, writing a code for finding 1000th prime number. I generated odd integers using candidate=range(3,10000,2). I need a little help on writing a next step. How do I check if each candidate is divisible by any other integers greater than 1. Do I have to do something like while(i

Question

Hi! Fellow OCW students! I have a question about problem 1 on problem set 1, writing a code for finding 1000th prime number. I generated odd integers using candidate=range(3,10000,2). I need a little help on writing a next step. How do I check if each candidate is divisible by any other integers greater than 1. Do I have to do something like while(i<x)
                        candidate[n] % i == 0 
                        n=n+1 
.....

anonymous · Answer

first find prime no and save them one byone in array 
after that loop call a[1000]

rsmith6559 · Answer

For starters, a for loop isn't suitable for generating candidates.  Once you get a candidate, what is the quickest way to check it?  Think of this as a standalone problem.  What do you need to do, and what do you have to determine if candidate is prime?