A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 3 years ago
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
 3 years ago
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 .....

This Question is Closed

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0first find prime no and save them one byone in array after that loop call a[1000]

rsmith6559
 3 years ago
Best ResponseYou've already chosen the best response.1For 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?
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.